./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI --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 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 --- 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-5e519f3 [2022-11-03 01:44:16,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:44:16,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:44:16,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:44:16,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:44:16,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:44:16,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:44:16,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:44:16,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:44:16,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:44:16,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:44:16,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:44:16,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:44:16,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:44:16,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:44:16,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:44:16,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:44:16,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:44:16,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:44:16,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:44:16,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:44:16,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:44:16,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:44:16,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:44:16,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:44:16,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:44:16,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:44:16,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:44:16,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:44:16,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:44:16,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:44:16,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:44:16,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:44:16,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:44:16,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:44:16,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:44:16,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:44:16,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:44:16,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:44:16,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:44:16,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:44:16,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:44:16,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:44:16,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:44:16,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:44:16,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:44:16,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:44:16,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:44:16,450 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:44:16,450 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:44:16,450 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:44:16,451 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:44:16,451 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:44:16,451 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:44:16,452 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:44:16,452 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:44:16,452 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:44:16,453 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:44:16,453 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:44:16,453 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:44:16,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:44:16,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:44:16,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:44:16,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:44:16,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:44:16,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:44:16,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:44:16,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:44:16,457 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:44:16,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:44:16,458 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:44:16,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:44:16,458 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:44:16,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:44:16,459 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:44:16,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:44:16,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:44:16,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:44:16,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:44:16,461 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:44:16,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:44:16,461 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:44:16,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:44:16,462 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:44:16,462 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_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/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_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI 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 -> 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 [2022-11-03 01:44:16,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:44:16,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:44:16,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:44:16,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:44:16,781 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:44:16,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2022-11-03 01:44:16,849 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/7810d3f74/a7ded4cb5b984452abc8f1cf2433ab39/FLAG6274baae5 [2022-11-03 01:44:17,448 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:44:17,449 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2022-11-03 01:44:17,465 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/7810d3f74/a7ded4cb5b984452abc8f1cf2433ab39/FLAG6274baae5 [2022-11-03 01:44:17,701 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/7810d3f74/a7ded4cb5b984452abc8f1cf2433ab39 [2022-11-03 01:44:17,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:44:17,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:44:17,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:44:17,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:44:17,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:44:17,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:44:17" (1/1) ... [2022-11-03 01:44:17,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70426645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:17, skipping insertion in model container [2022-11-03 01:44:17,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:44:17" (1/1) ... [2022-11-03 01:44:17,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:44:17,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:44:18,304 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[37019,37032] [2022-11-03 01:44:18,452 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[47352,47365] [2022-11-03 01:44:18,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:44:18,510 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-03 01:44:18,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d52780e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:18, skipping insertion in model container [2022-11-03 01:44:18,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:44:18,512 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 01:44:18,514 INFO L158 Benchmark]: Toolchain (without parser) took 808.50ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 74.5MB in the end (delta: 3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:44:18,516 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 111.1MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:44:18,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.56ms. Allocated memory is still 111.1MB. Free memory was 77.4MB in the beginning and 74.5MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:44:18,520 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.27ms. Allocated memory is still 111.1MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.56ms. Allocated memory is still 111.1MB. Free memory was 77.4MB in the beginning and 74.5MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI --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 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 --- 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-5e519f3 [2022-11-03 01:44:20,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:44:20,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:44:20,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:44:20,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:44:20,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:44:20,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:44:20,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:44:20,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:44:20,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:44:20,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:44:20,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:44:20,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:44:20,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:44:20,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:44:20,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:44:20,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:44:20,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:44:20,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:44:20,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:44:20,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:44:20,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:44:20,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:44:20,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:44:20,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:44:20,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:44:20,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:44:20,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:44:20,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:44:20,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:44:20,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:44:20,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:44:20,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:44:20,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:44:20,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:44:20,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:44:20,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:44:20,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:44:20,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:44:20,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:44:20,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:44:20,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 01:44:21,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:44:21,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:44:21,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:44:21,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:44:21,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:44:21,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:44:21,009 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:44:21,009 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:44:21,009 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:44:21,009 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:44:21,010 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:44:21,011 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:44:21,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:44:21,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:44:21,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:44:21,013 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:44:21,013 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:44:21,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:44:21,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:44:21,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:44:21,014 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:44:21,014 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:44:21,014 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:44:21,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:44:21,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:44:21,015 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 01:44:21,015 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 01:44:21,015 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:44:21,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:44:21,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:44:21,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 01:44:21,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:44:21,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:44:21,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:44:21,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:44:21,017 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 01:44:21,018 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 01:44:21,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:44:21,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 01:44:21,018 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_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/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_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI 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 -> 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 [2022-11-03 01:44:21,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:44:21,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:44:21,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:44:21,455 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:44:21,456 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:44:21,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2022-11-03 01:44:21,534 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/e184564fd/44c17b0e59e04658b5c11d8946c2e5a4/FLAGe0e3bbd48 [2022-11-03 01:44:22,273 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:44:22,274 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2022-11-03 01:44:22,295 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/e184564fd/44c17b0e59e04658b5c11d8946c2e5a4/FLAGe0e3bbd48 [2022-11-03 01:44:22,522 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/data/e184564fd/44c17b0e59e04658b5c11d8946c2e5a4 [2022-11-03 01:44:22,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:44:22,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:44:22,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:44:22,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:44:22,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:44:22,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:44:22" (1/1) ... [2022-11-03 01:44:22,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f144cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:22, skipping insertion in model container [2022-11-03 01:44:22,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:44:22" (1/1) ... [2022-11-03 01:44:22,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:44:22,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:44:23,136 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[37019,37032] [2022-11-03 01:44:23,291 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[47352,47365] [2022-11-03 01:44:23,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:44:23,321 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 01:44:23,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:44:23,352 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[37019,37032] [2022-11-03 01:44:23,416 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[47352,47365] [2022-11-03 01:44:23,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:44:23,454 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:44:23,483 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[37019,37032] [2022-11-03 01:44:23,565 WARN L230 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_d15fc86c-f392-4e1f-849a-a9e808630802/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i[47352,47365] [2022-11-03 01:44:23,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:44:23,634 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:44:23,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23 WrapperNode [2022-11-03 01:44:23,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:44:23,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:44:23,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:44:23,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:44:23,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,743 INFO L138 Inliner]: procedures = 211, calls = 286, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1054 [2022-11-03 01:44:23,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:44:23,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:44:23,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:44:23,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:44:23,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,843 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:44:23,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:44:23,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:44:23,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:44:23,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (1/1) ... [2022-11-03 01:44:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:44:23,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:23,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:44:23,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:44:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 01:44:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 01:44:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-03 01:44:23,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-03 01:44:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:44:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-03 01:44:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:44:23,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:44:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 01:44:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 01:44:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 01:44:23,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 01:44:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:44:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:44:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:44:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:44:23,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:44:24,241 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:44:24,244 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:44:24,248 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:44:29,695 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:44:29,709 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:44:29,709 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-03 01:44:29,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:44:29 BoogieIcfgContainer [2022-11-03 01:44:29,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:44:29,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:44:29,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:44:29,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:44:29,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:44:22" (1/3) ... [2022-11-03 01:44:29,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1801b358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:44:29, skipping insertion in model container [2022-11-03 01:44:29,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:44:23" (2/3) ... [2022-11-03 01:44:29,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1801b358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:44:29, skipping insertion in model container [2022-11-03 01:44:29,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:44:29" (3/3) ... [2022-11-03 01:44:29,722 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-2.i [2022-11-03 01:44:29,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:44:29,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-11-03 01:44:29,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:44:29,846 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;@76d7c9d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:44:29,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-11-03 01:44:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 1081 states, 537 states have (on average 2.2364990689013036) internal successors, (1201), 1075 states have internal predecessors, (1201), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:44:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:44:29,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:29,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:44:29,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-11-03 01:44:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056426794] [2022-11-03 01:44:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:29,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:29,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:29,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:29,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 01:44:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:30,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:30,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:30,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:30,193 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-03 01:44:30,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:30,194 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:30,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056426794] [2022-11-03 01:44:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056426794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:30,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:44:30,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138572211] [2022-11-03 01:44:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:30,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:30,239 INFO L87 Difference]: Start difference. First operand has 1081 states, 537 states have (on average 2.2364990689013036) internal successors, (1201), 1075 states have internal predecessors, (1201), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03 01:44:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:32,777 INFO L93 Difference]: Finished difference Result 1245 states and 1321 transitions. [2022-11-03 01:44:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-03 01:44:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:32,805 INFO L225 Difference]: With dead ends: 1245 [2022-11-03 01:44:32,805 INFO L226 Difference]: Without dead ends: 1243 [2022-11-03 01:44:32,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03 01:44:32,819 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 995 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:32,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 805 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 01:44:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-11-03 01:44:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1065. [2022-11-03 01:44:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 537 states have (on average 2.080074487895717) internal successors, (1117), 1059 states have internal predecessors, (1117), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:44:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1133 transitions. [2022-11-03 01:44:32,922 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1133 transitions. Word has length 3 [2022-11-03 01:44:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:32,923 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1133 transitions. [2022-11-03 01:44:32,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03 01:44:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1133 transitions. [2022-11-03 01:44:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:44:32,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:32,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:44:32,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 01:44:33,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:33,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-11-03 01:44:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:33,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275241440] [2022-11-03 01:44:33,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:33,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:33,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:33,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 01:44:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:33,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:33,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:33,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:33,326 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-03 01:44:33,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:33,327 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275241440] [2022-11-03 01:44:33,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275241440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:33,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:33,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:44:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975468054] [2022-11-03 01:44:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:33,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:33,338 INFO L87 Difference]: Start difference. First operand 1065 states and 1133 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03 01:44:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:36,992 INFO L93 Difference]: Finished difference Result 1483 states and 1593 transitions. [2022-11-03 01:44:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-03 01:44:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:36,999 INFO L225 Difference]: With dead ends: 1483 [2022-11-03 01:44:37,000 INFO L226 Difference]: Without dead ends: 1483 [2022-11-03 01:44:37,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03 01:44:37,001 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 450 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:37,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1540 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 01:44:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-11-03 01:44:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1197. [2022-11-03 01:44:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 665 states have (on average 2.037593984962406) internal successors, (1355), 1191 states have internal predecessors, (1355), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1381 transitions. [2022-11-03 01:44:37,035 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1381 transitions. Word has length 3 [2022-11-03 01:44:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:37,035 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1381 transitions. [2022-11-03 01:44:37,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03 01:44:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1381 transitions. [2022-11-03 01:44:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:44:37,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:37,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:37,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:37,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-11-03 01:44:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307707010] [2022-11-03 01:44:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:37,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:37,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 01:44:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:37,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:44:37,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:37,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:37,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:37,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:37,574 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:44:37,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:37,607 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-03 01:44:37,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:37,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:37,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307707010] [2022-11-03 01:44:37,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307707010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:37,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:37,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348611452] [2022-11-03 01:44:37,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:37,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:37,617 INFO L87 Difference]: Start difference. First operand 1197 states and 1381 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:41,696 INFO L93 Difference]: Finished difference Result 1364 states and 1556 transitions. [2022-11-03 01:44:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:44:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:41,704 INFO L225 Difference]: With dead ends: 1364 [2022-11-03 01:44:41,704 INFO L226 Difference]: Without dead ends: 1364 [2022-11-03 01:44:41,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03 01:44:41,708 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 1267 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:41,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 473 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-03 01:44:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-11-03 01:44:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1054. [2022-11-03 01:44:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 537 states have (on average 2.0577281191806334) internal successors, (1105), 1048 states have internal predecessors, (1105), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:44:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1121 transitions. [2022-11-03 01:44:41,747 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1121 transitions. Word has length 7 [2022-11-03 01:44:41,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:41,748 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1121 transitions. [2022-11-03 01:44:41,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1121 transitions. [2022-11-03 01:44:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:44:41,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:41,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:41,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:41,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:41,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-11-03 01:44:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:41,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079613274] [2022-11-03 01:44:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:41,965 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:41,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 01:44:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:42,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:42,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:42,147 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-03 01:44:42,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:42,147 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:42,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079613274] [2022-11-03 01:44:42,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079613274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:42,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:42,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:44:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162788949] [2022-11-03 01:44:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:42,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:42,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:42,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:42,150 INFO L87 Difference]: Start difference. First operand 1054 states and 1121 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 01:44:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:44,597 INFO L93 Difference]: Finished difference Result 1230 states and 1328 transitions. [2022-11-03 01:44:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-03 01:44:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:44,604 INFO L225 Difference]: With dead ends: 1230 [2022-11-03 01:44:44,604 INFO L226 Difference]: Without dead ends: 1230 [2022-11-03 01:44:44,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-03 01:44:44,606 INFO L413 NwaCegarLoop]: 906 mSDtfsCounter, 814 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:44,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1183 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 01:44:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-11-03 01:44:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1007. [2022-11-03 01:44:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 537 states have (on average 1.9702048417132216) internal successors, (1058), 1001 states have internal predecessors, (1058), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:44:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1074 transitions. [2022-11-03 01:44:44,647 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1074 transitions. Word has length 8 [2022-11-03 01:44:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:44,648 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1074 transitions. [2022-11-03 01:44:44,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 01:44:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1074 transitions. [2022-11-03 01:44:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:44:44,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:44,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:44,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:44,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:44,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-11-03 01:44:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:44,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588416000] [2022-11-03 01:44:44,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:44,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:44,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:44,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:44,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 01:44:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:45,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:45,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:45,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:45,106 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-03 01:44:45,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:45,107 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:45,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588416000] [2022-11-03 01:44:45,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588416000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:45,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:45,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:44:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031865867] [2022-11-03 01:44:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:45,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:45,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:45,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:45,110 INFO L87 Difference]: Start difference. First operand 1007 states and 1074 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 01:44:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:48,362 INFO L93 Difference]: Finished difference Result 1295 states and 1396 transitions. [2022-11-03 01:44:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-03 01:44:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:48,367 INFO L225 Difference]: With dead ends: 1295 [2022-11-03 01:44:48,368 INFO L226 Difference]: Without dead ends: 1295 [2022-11-03 01:44:48,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-03 01:44:48,369 INFO L413 NwaCegarLoop]: 1098 mSDtfsCounter, 499 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:48,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1541 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 01:44:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-11-03 01:44:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1029. [2022-11-03 01:44:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 569 states have (on average 1.9578207381370827) internal successors, (1114), 1023 states have internal predecessors, (1114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:44:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1130 transitions. [2022-11-03 01:44:48,398 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1130 transitions. Word has length 8 [2022-11-03 01:44:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:48,399 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1130 transitions. [2022-11-03 01:44:48,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 01:44:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1130 transitions. [2022-11-03 01:44:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:44:48,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:48,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:48,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:48,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:48,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 871160987, now seen corresponding path program 1 times [2022-11-03 01:44:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:48,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496967606] [2022-11-03 01:44:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:48,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:48,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:48,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 01:44:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:48,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:48,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:48,871 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-03 01:44:48,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:48,875 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496967606] [2022-11-03 01:44:48,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496967606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:48,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:48,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299232771] [2022-11-03 01:44:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:48,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:48,877 INFO L87 Difference]: Start difference. First operand 1029 states and 1130 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-03 01:44:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:49,208 INFO L93 Difference]: Finished difference Result 1506 states and 1652 transitions. [2022-11-03 01:44:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:49,209 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-03 01:44:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:49,215 INFO L225 Difference]: With dead ends: 1506 [2022-11-03 01:44:49,215 INFO L226 Difference]: Without dead ends: 1506 [2022-11-03 01:44:49,216 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-03 01:44:49,217 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 570 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:49,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 2038 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:44:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2022-11-03 01:44:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1213. [2022-11-03 01:44:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 748 states have (on average 1.8997326203208555) internal successors, (1421), 1207 states have internal predecessors, (1421), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1447 transitions. [2022-11-03 01:44:49,246 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1447 transitions. Word has length 11 [2022-11-03 01:44:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:49,246 INFO L495 AbstractCegarLoop]: Abstraction has 1213 states and 1447 transitions. [2022-11-03 01:44:49,247 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-03 01:44:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1447 transitions. [2022-11-03 01:44:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 01:44:49,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:49,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:49,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-03 01:44:49,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:49,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-11-03 01:44:49,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931751178] [2022-11-03 01:44:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:49,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:49,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:49,468 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:49,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 01:44:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:49,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:44:49,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:49,655 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-03 01:44:49,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:49,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:49,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931751178] [2022-11-03 01:44:49,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931751178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:49,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:49,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877702562] [2022-11-03 01:44:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:49,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:49,658 INFO L87 Difference]: Start difference. First operand 1213 states and 1447 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 01:44:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:49,695 INFO L93 Difference]: Finished difference Result 1367 states and 1587 transitions. [2022-11-03 01:44:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 01:44:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:49,700 INFO L225 Difference]: With dead ends: 1367 [2022-11-03 01:44:49,700 INFO L226 Difference]: Without dead ends: 1367 [2022-11-03 01:44:49,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-03 01:44:49,701 INFO L413 NwaCegarLoop]: 1222 mSDtfsCounter, 404 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2044 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-03 01:44:49,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2044 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:44:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-11-03 01:44:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1153. [2022-11-03 01:44:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 712 states have (on average 1.875) internal successors, (1335), 1147 states have internal predecessors, (1335), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1361 transitions. [2022-11-03 01:44:49,728 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1361 transitions. Word has length 13 [2022-11-03 01:44:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:49,728 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1361 transitions. [2022-11-03 01:44:49,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 01:44:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1361 transitions. [2022-11-03 01:44:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:44:49,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:49,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:49,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-03 01:44:49,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:49,942 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1723272146, now seen corresponding path program 1 times [2022-11-03 01:44:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:49,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610187459] [2022-11-03 01:44:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:49,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:49,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:49,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 01:44:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:50,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:44:50,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:50,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:50,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:50,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:50,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-03 01:44:50,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:50,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-03 01:44:50,313 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-03 01:44:50,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:50,314 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610187459] [2022-11-03 01:44:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610187459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:50,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:50,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:44:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767414755] [2022-11-03 01:44:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:50,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:50,317 INFO L87 Difference]: Start difference. First operand 1153 states and 1361 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03 01:44:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:51,810 INFO L93 Difference]: Finished difference Result 1490 states and 1749 transitions. [2022-11-03 01:44:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:51,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-11-03 01:44:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:51,816 INFO L225 Difference]: With dead ends: 1490 [2022-11-03 01:44:51,816 INFO L226 Difference]: Without dead ends: 1490 [2022-11-03 01:44:51,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:44:51,817 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 342 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:51,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 2835 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 01:44:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-11-03 01:44:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1152. [2022-11-03 01:44:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 711 states have (on average 1.8748241912798875) internal successors, (1333), 1146 states have internal predecessors, (1333), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1359 transitions. [2022-11-03 01:44:51,844 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1359 transitions. Word has length 14 [2022-11-03 01:44:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:51,844 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 1359 transitions. [2022-11-03 01:44:51,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03 01:44:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1359 transitions. [2022-11-03 01:44:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:44:51,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:51,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:51,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:52,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:52,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-11-03 01:44:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48342710] [2022-11-03 01:44:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:52,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:52,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:52,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:52,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 01:44:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:52,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:44:52,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:52,282 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-03 01:44:52,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:52,282 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:52,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48342710] [2022-11-03 01:44:52,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48342710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:52,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:52,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309763239] [2022-11-03 01:44:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:52,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:52,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:52,285 INFO L87 Difference]: Start difference. First operand 1152 states and 1359 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03 01:44:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:52,319 INFO L93 Difference]: Finished difference Result 1092 states and 1273 transitions. [2022-11-03 01:44:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:52,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-03 01:44:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:52,324 INFO L225 Difference]: With dead ends: 1092 [2022-11-03 01:44:52,324 INFO L226 Difference]: Without dead ends: 1092 [2022-11-03 01:44:52,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-03 01:44:52,328 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 943 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1006 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-03 01:44:52,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1006 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:44:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-11-03 01:44:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2022-11-03 01:44:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 675 states have (on average 1.8474074074074074) internal successors, (1247), 1086 states have internal predecessors, (1247), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1273 transitions. [2022-11-03 01:44:52,364 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1273 transitions. Word has length 18 [2022-11-03 01:44:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:52,365 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 1273 transitions. [2022-11-03 01:44:52,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03 01:44:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1273 transitions. [2022-11-03 01:44:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:44:52,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:52,366 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] [2022-11-03 01:44:52,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:52,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:52,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-11-03 01:44:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:52,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977643520] [2022-11-03 01:44:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:52,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:52,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:52,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:52,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 01:44:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:52,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:52,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:52,809 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-03 01:44:52,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:52,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:52,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977643520] [2022-11-03 01:44:52,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977643520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:52,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:52,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:44:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32881751] [2022-11-03 01:44:52,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:52,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:52,812 INFO L87 Difference]: Start difference. First operand 1092 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-03 01:44:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:52,891 INFO L93 Difference]: Finished difference Result 1064 states and 1217 transitions. [2022-11-03 01:44:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-03 01:44:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:52,899 INFO L225 Difference]: With dead ends: 1064 [2022-11-03 01:44:52,899 INFO L226 Difference]: Without dead ends: 1064 [2022-11-03 01:44:52,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-03 01:44:52,900 INFO L413 NwaCegarLoop]: 929 mSDtfsCounter, 914 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:52,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1883 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-11-03 01:44:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1062. [2022-11-03 01:44:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 659 states have (on average 1.8042488619119879) internal successors, (1189), 1056 states have internal predecessors, (1189), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1215 transitions. [2022-11-03 01:44:52,920 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1215 transitions. Word has length 20 [2022-11-03 01:44:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:52,920 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1215 transitions. [2022-11-03 01:44:52,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-03 01:44:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1215 transitions. [2022-11-03 01:44:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:44:52,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:52,923 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] [2022-11-03 01:44:52,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:53,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:53,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-11-03 01:44:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:53,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052695643] [2022-11-03 01:44:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:53,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:53,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 01:44:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:53,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:53,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:53,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:53,438 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-03 01:44:53,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:53,439 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:53,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052695643] [2022-11-03 01:44:53,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052695643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:53,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:53,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141237460] [2022-11-03 01:44:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:53,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:53,441 INFO L87 Difference]: Start difference. First operand 1062 states and 1215 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-03 01:44:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:56,048 INFO L93 Difference]: Finished difference Result 1513 states and 1751 transitions. [2022-11-03 01:44:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:56,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-03 01:44:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:56,053 INFO L225 Difference]: With dead ends: 1513 [2022-11-03 01:44:56,054 INFO L226 Difference]: Without dead ends: 1513 [2022-11-03 01:44:56,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-03 01:44:56,056 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 1462 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:56,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 1057 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-03 01:44:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2022-11-03 01:44:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1058. [2022-11-03 01:44:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 659 states have (on average 1.7921092564491654) internal successors, (1181), 1052 states have internal predecessors, (1181), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:44:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1207 transitions. [2022-11-03 01:44:56,086 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1207 transitions. Word has length 34 [2022-11-03 01:44:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:56,089 INFO L495 AbstractCegarLoop]: Abstraction has 1058 states and 1207 transitions. [2022-11-03 01:44:56,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-03 01:44:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1207 transitions. [2022-11-03 01:44:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:44:56,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:56,091 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] [2022-11-03 01:44:56,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:56,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:56,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:44:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-11-03 01:44:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:56,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53535429] [2022-11-03 01:44:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:56,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:56,308 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:56,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 01:44:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:56,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:44:56,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:56,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:56,780 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-03 01:44:56,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:56,780 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:56,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53535429] [2022-11-03 01:44:56,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53535429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:56,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:56,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039672086] [2022-11-03 01:44:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:56,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:56,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:56,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:56,782 INFO L87 Difference]: Start difference. First operand 1058 states and 1207 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-03 01:45:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:00,918 INFO L93 Difference]: Finished difference Result 1570 states and 1773 transitions. [2022-11-03 01:45:00,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:45:00,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-03 01:45:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:00,923 INFO L225 Difference]: With dead ends: 1570 [2022-11-03 01:45:00,924 INFO L226 Difference]: Without dead ends: 1570 [2022-11-03 01:45:00,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-03 01:45:00,925 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 928 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:00,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 2162 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 01:45:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-11-03 01:45:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1054. [2022-11-03 01:45:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 659 states have (on average 1.779969650986343) internal successors, (1173), 1048 states have internal predecessors, (1173), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:45:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1199 transitions. [2022-11-03 01:45:00,945 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1199 transitions. Word has length 34 [2022-11-03 01:45:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:00,945 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1199 transitions. [2022-11-03 01:45:00,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-03 01:45:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1199 transitions. [2022-11-03 01:45:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 01:45:00,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:00,947 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] [2022-11-03 01:45:00,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:01,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:01,160 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-11-03 01:45:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:01,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196283863] [2022-11-03 01:45:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:01,163 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:01,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 01:45:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:01,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:01,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:01,519 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-03 01:45:01,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:01,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:01,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196283863] [2022-11-03 01:45:01,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196283863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:01,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:01,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796122334] [2022-11-03 01:45:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:01,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:01,522 INFO L87 Difference]: Start difference. First operand 1054 states and 1199 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03 01:45:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:01,599 INFO L93 Difference]: Finished difference Result 1042 states and 1179 transitions. [2022-11-03 01:45:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-11-03 01:45:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:01,603 INFO L225 Difference]: With dead ends: 1042 [2022-11-03 01:45:01,603 INFO L226 Difference]: Without dead ends: 1042 [2022-11-03 01:45:01,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-03 01:45:01,605 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 890 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:01,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1861 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:45:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-11-03 01:45:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-11-03 01:45:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 647 states have (on average 1.7820710973724885) internal successors, (1153), 1036 states have internal predecessors, (1153), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:45:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1179 transitions. [2022-11-03 01:45:01,622 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1179 transitions. Word has length 52 [2022-11-03 01:45:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:01,624 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1179 transitions. [2022-11-03 01:45:01,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03 01:45:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1179 transitions. [2022-11-03 01:45:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 01:45:01,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:01,628 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] [2022-11-03 01:45:01,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:01,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:01,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:01,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-11-03 01:45:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:01,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971920826] [2022-11-03 01:45:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:01,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:01,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:01,846 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:01,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 01:45:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:02,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:45:02,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:02,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:02,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:02,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:02,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:02,821 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:45:02,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:02,843 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-03 01:45:02,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:02,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971920826] [2022-11-03 01:45:02,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971920826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:02,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:02,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767484209] [2022-11-03 01:45:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:02,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:02,847 INFO L87 Difference]: Start difference. First operand 1042 states and 1179 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-03 01:45:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:05,823 INFO L93 Difference]: Finished difference Result 1264 states and 1480 transitions. [2022-11-03 01:45:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-11-03 01:45:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:05,830 INFO L225 Difference]: With dead ends: 1264 [2022-11-03 01:45:05,830 INFO L226 Difference]: Without dead ends: 1264 [2022-11-03 01:45:05,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-03 01:45:05,831 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 843 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:05,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 758 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-03 01:45:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-11-03 01:45:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 972. [2022-11-03 01:45:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 615 states have (on average 1.7056910569105692) internal successors, (1049), 966 states have internal predecessors, (1049), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:45:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1075 transitions. [2022-11-03 01:45:05,851 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1075 transitions. Word has length 60 [2022-11-03 01:45:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:05,851 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1075 transitions. [2022-11-03 01:45:05,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-03 01:45:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1075 transitions. [2022-11-03 01:45:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-03 01:45:05,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:05,853 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] [2022-11-03 01:45:05,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:06,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:06,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-11-03 01:45:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:06,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279897432] [2022-11-03 01:45:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:06,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:06,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:06,073 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:06,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 01:45:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:06,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:45:06,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:06,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:06,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:06,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:06,585 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-03 01:45:06,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:06,585 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279897432] [2022-11-03 01:45:06,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279897432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:06,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:06,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981477982] [2022-11-03 01:45:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:06,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:06,588 INFO L87 Difference]: Start difference. First operand 972 states and 1075 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-03 01:45:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:09,539 INFO L93 Difference]: Finished difference Result 971 states and 1074 transitions. [2022-11-03 01:45:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-03 01:45:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:09,542 INFO L225 Difference]: With dead ends: 971 [2022-11-03 01:45:09,542 INFO L226 Difference]: Without dead ends: 971 [2022-11-03 01:45:09,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-03 01:45:09,543 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 4 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:09,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2294 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-03 01:45:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-11-03 01:45:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2022-11-03 01:45:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 615 states have (on average 1.7040650406504065) internal successors, (1048), 965 states have internal predecessors, (1048), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:45:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1074 transitions. [2022-11-03 01:45:09,558 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1074 transitions. Word has length 65 [2022-11-03 01:45:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:09,559 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 1074 transitions. [2022-11-03 01:45:09,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-03 01:45:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1074 transitions. [2022-11-03 01:45:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-03 01:45:09,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:09,560 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] [2022-11-03 01:45:09,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-03 01:45:09,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:09,776 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:09,777 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-11-03 01:45:09,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:09,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646301754] [2022-11-03 01:45:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:09,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:09,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:09,779 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:09,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 01:45:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:10,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:45:10,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:10,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:10,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:10,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:10,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:10,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:10,319 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-03 01:45:10,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:10,320 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646301754] [2022-11-03 01:45:10,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646301754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:10,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:10,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:10,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192614700] [2022-11-03 01:45:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:10,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:10,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:10,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:10,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:10,322 INFO L87 Difference]: Start difference. First operand 971 states and 1074 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-03 01:45:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:14,032 INFO L93 Difference]: Finished difference Result 970 states and 1073 transitions. [2022-11-03 01:45:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-03 01:45:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:14,037 INFO L225 Difference]: With dead ends: 970 [2022-11-03 01:45:14,037 INFO L226 Difference]: Without dead ends: 970 [2022-11-03 01:45:14,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-03 01:45:14,038 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:14,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2330 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 01:45:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-03 01:45:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-03 01:45:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 614 states have (on average 1.705211726384365) internal successors, (1047), 964 states have internal predecessors, (1047), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:45:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1073 transitions. [2022-11-03 01:45:14,053 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1073 transitions. Word has length 65 [2022-11-03 01:45:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:14,054 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1073 transitions. [2022-11-03 01:45:14,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-03 01:45:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1073 transitions. [2022-11-03 01:45:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 01:45:14,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:14,055 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, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:14,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:14,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:14,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 864578415, now seen corresponding path program 1 times [2022-11-03 01:45:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:14,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825259349] [2022-11-03 01:45:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:14,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:14,273 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:14,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 01:45:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:14,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:14,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:14,655 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-03 01:45:14,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:14,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:14,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825259349] [2022-11-03 01:45:14,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825259349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:14,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:14,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916577659] [2022-11-03 01:45:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:14,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:14,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:14,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:14,658 INFO L87 Difference]: Start difference. First operand 970 states and 1073 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03 01:45:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:14,720 INFO L93 Difference]: Finished difference Result 973 states and 1077 transitions. [2022-11-03 01:45:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2022-11-03 01:45:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:14,726 INFO L225 Difference]: With dead ends: 973 [2022-11-03 01:45:14,726 INFO L226 Difference]: Without dead ends: 973 [2022-11-03 01:45:14,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-03 01:45:14,727 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 2 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:14,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2644 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:45:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-03 01:45:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2022-11-03 01:45:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 616 states have (on average 1.7045454545454546) internal successors, (1050), 967 states have internal predecessors, (1050), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:45:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1077 transitions. [2022-11-03 01:45:14,755 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1077 transitions. Word has length 73 [2022-11-03 01:45:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:14,756 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1077 transitions. [2022-11-03 01:45:14,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03 01:45:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1077 transitions. [2022-11-03 01:45:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-03 01:45:14,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:14,757 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:14,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:14,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:14,976 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1994106300, now seen corresponding path program 1 times [2022-11-03 01:45:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:14,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944351346] [2022-11-03 01:45:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:14,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:14,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 01:45:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:15,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:45:15,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:15,394 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-03 01:45:15,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:15,511 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-03 01:45:15,511 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944351346] [2022-11-03 01:45:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944351346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:15,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1176609972] [2022-11-03 01:45:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:15,514 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:45:15,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:45:15,519 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:45:15,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-03 01:45:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:16,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:45:16,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:16,164 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-03 01:45:16,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:16,224 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-03 01:45:16,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1176609972] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137889573] [2022-11-03 01:45:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:16,227 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:16,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 01:45:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:16,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:45:16,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:16,588 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-03 01:45:16,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:16,640 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-03 01:45:16,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137889573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:16,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:45:16,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-03 01:45:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110335359] [2022-11-03 01:45:16,645 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:45:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:45:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:45:16,647 INFO L87 Difference]: Start difference. First operand 973 states and 1077 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-03 01:45:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:16,870 INFO L93 Difference]: Finished difference Result 985 states and 1094 transitions. [2022-11-03 01:45:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:45:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 74 [2022-11-03 01:45:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:16,874 INFO L225 Difference]: With dead ends: 985 [2022-11-03 01:45:16,874 INFO L226 Difference]: Without dead ends: 985 [2022-11-03 01:45:16,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 432 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-03 01:45:16,875 INFO L413 NwaCegarLoop]: 884 mSDtfsCounter, 12 mSDsluCounter, 4396 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5280 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:16,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5280 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:45:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-11-03 01:45:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 983. [2022-11-03 01:45:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 625 states have (on average 1.704) internal successors, (1065), 976 states have internal predecessors, (1065), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:45:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1092 transitions. [2022-11-03 01:45:16,893 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1092 transitions. Word has length 74 [2022-11-03 01:45:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:16,893 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1092 transitions. [2022-11-03 01:45:16,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-03 01:45:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1092 transitions. [2022-11-03 01:45:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-03 01:45:16,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:16,895 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:16,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:17,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:17,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:17,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 01:45:17,509 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:45:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 195761839, now seen corresponding path program 2 times [2022-11-03 01:45:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:17,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125843938] [2022-11-03 01:45:17,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:45:17,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:17,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:17,512 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:17,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 01:45:18,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:45:18,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:45:18,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:45:18,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:18,143 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-03 01:45:18,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:18,429 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-03 01:45:18,430 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:18,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125843938] [2022-11-03 01:45:18,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125843938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:18,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712503782] [2022-11-03 01:45:18,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:45:18,430 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:45:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:45:18,434 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:45:18,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-03 01:45:20,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:45:20,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:45:20,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:45:20,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:20,336 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-03 01:45:20,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:20,432 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-03 01:45:20,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712503782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477875411] [2022-11-03 01:45:20,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:45:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:20,437 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:20,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 01:45:57,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:45:57,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:45:57,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:45:57,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:57,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:57,977 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:45:57,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,520 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1620))) (exists ((v_ArrVal_1621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1621) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-03 01:45:58,537 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1622))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1623) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:45:58,555 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1624))) (exists ((v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1625))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-03 01:45:58,614 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:58,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:45:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-03 01:45:58,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:59,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2022-11-03 01:45:59,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477875411] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:59,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 01:45:59,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 12] total 25 [2022-11-03 01:45:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128774848] [2022-11-03 01:45:59,262 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:59,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 01:45:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 01:45:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=16, NotChecked=188, Total=756 [2022-11-03 01:45:59,263 INFO L87 Difference]: Start difference. First operand 983 states and 1092 transitions. Second operand has 25 states, 24 states have (on average 5.916666666666667) internal successors, (142), 25 states have internal predecessors, (142), 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-03 01:46:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:13,645 INFO L93 Difference]: Finished difference Result 2080 states and 2448 transitions. [2022-11-03 01:46:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 01:46:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.916666666666667) internal successors, (142), 25 states have internal predecessors, (142), 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 77 [2022-11-03 01:46:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:13,654 INFO L225 Difference]: With dead ends: 2080 [2022-11-03 01:46:13,654 INFO L226 Difference]: Without dead ends: 2074 [2022-11-03 01:46:13,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=359, Invalid=2219, Unknown=90, NotChecked=412, Total=3080 [2022-11-03 01:46:13,656 INFO L413 NwaCegarLoop]: 787 mSDtfsCounter, 1616 mSDsluCounter, 7081 mSDsCounter, 0 mSdLazyCounter, 5380 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 7868 SdHoareTripleChecker+Invalid, 12484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 5380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7045 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:13,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 7868 Invalid, 12484 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 5380 Invalid, 0 Unknown, 7045 Unchecked, 12.0s Time] [2022-11-03 01:46:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-11-03 01:46:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 990. [2022-11-03 01:46:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 633 states have (on average 1.6951026856240126) internal successors, (1073), 983 states have internal predecessors, (1073), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:46:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1100 transitions. [2022-11-03 01:46:13,681 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1100 transitions. Word has length 77 [2022-11-03 01:46:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:13,682 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1100 transitions. [2022-11-03 01:46:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.916666666666667) internal successors, (142), 25 states have internal predecessors, (142), 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-03 01:46:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1100 transitions. [2022-11-03 01:46:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-03 01:46:13,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:13,683 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:13,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:13,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:14,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-03 01:46:14,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:46:14,289 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:46:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash -904609989, now seen corresponding path program 1 times [2022-11-03 01:46:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:46:14,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446166209] [2022-11-03 01:46:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:46:14,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:46:14,292 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:46:14,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 01:46:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:46:14,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:14,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:15,456 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:46:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446166209] [2022-11-03 01:46:15,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446166209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:15,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [96585950] [2022-11-03 01:46:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:46:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:46:15,461 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:46:15,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-03 01:46:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:16,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:46:16,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:16,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:16,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [96585950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:16,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920581305] [2022-11-03 01:46:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:16,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:16,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:16,392 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:16,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 01:46:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:16,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:46:16,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:16,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:17,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920581305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:17,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:46:17,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2022-11-03 01:46:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691352186] [2022-11-03 01:46:17,903 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:17,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 01:46:17,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:46:17,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 01:46:17,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 01:46:17,905 INFO L87 Difference]: Start difference. First operand 990 states and 1100 transitions. Second operand has 35 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 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-03 01:46:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:21,331 INFO L93 Difference]: Finished difference Result 1032 states and 1153 transitions. [2022-11-03 01:46:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 01:46:21,332 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 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 82 [2022-11-03 01:46:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:21,336 INFO L225 Difference]: With dead ends: 1032 [2022-11-03 01:46:21,336 INFO L226 Difference]: Without dead ends: 1022 [2022-11-03 01:46:21,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 01:46:21,338 INFO L413 NwaCegarLoop]: 890 mSDtfsCounter, 152 mSDsluCounter, 12382 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 13272 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:21,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 13272 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-03 01:46:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-11-03 01:46:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1006. [2022-11-03 01:46:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 649 states have (on average 1.6810477657935285) internal successors, (1091), 999 states have internal predecessors, (1091), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:46:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1118 transitions. [2022-11-03 01:46:21,368 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1118 transitions. Word has length 82 [2022-11-03 01:46:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:21,368 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1118 transitions. [2022-11-03 01:46:21,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 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-03 01:46:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1118 transitions. [2022-11-03 01:46:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-03 01:46:21,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:21,370 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:21,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:21,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-03 01:46:21,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:21,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 01:46:21,987 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:46:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1635155026, now seen corresponding path program 2 times [2022-11-03 01:46:21,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:46:21,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894979250] [2022-11-03 01:46:21,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:46:21,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:46:21,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:46:21,989 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:46:21,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 01:46:22,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:46:22,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:22,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 01:46:22,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:23,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:25,137 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:46:25,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894979250] [2022-11-03 01:46:25,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894979250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:25,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425497851] [2022-11-03 01:46:25,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:46:25,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:46:25,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:46:25,144 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:46:25,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-03 01:46:27,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:46:27,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:27,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 01:46:27,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:27,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:27,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [425497851] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:27,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153613644] [2022-11-03 01:46:27,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:46:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:27,933 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:27,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 01:46:49,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:46:49,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:49,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 01:46:49,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:50,235 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:46:50,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:46:50,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:46:53,279 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:53,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:46:53,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:46:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-03 01:46:53,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:53,811 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 01:46:53,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:46:53,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2833) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2022-11-03 01:46:53,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153613644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:53,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 01:46:53,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 11] total 56 [2022-11-03 01:46:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940756694] [2022-11-03 01:46:53,827 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-03 01:46:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:46:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-03 01:46:53,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=2593, Unknown=2, NotChecked=110, Total=3306 [2022-11-03 01:46:53,830 INFO L87 Difference]: Start difference. First operand 1006 states and 1118 transitions. Second operand has 56 states, 55 states have (on average 3.1272727272727274) internal successors, (172), 55 states have internal predecessors, (172), 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-03 01:47:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:36,989 INFO L93 Difference]: Finished difference Result 2145 states and 2562 transitions. [2022-11-03 01:47:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-03 01:47:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.1272727272727274) internal successors, (172), 55 states have internal predecessors, (172), 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 93 [2022-11-03 01:47:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:36,997 INFO L225 Difference]: With dead ends: 2145 [2022-11-03 01:47:36,997 INFO L226 Difference]: Without dead ends: 2141 [2022-11-03 01:47:37,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 390 SyntacticMatches, 19 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2286, Invalid=10060, Unknown=90, NotChecked=220, Total=12656 [2022-11-03 01:47:37,001 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 1602 mSDsluCounter, 24945 mSDsCounter, 0 mSdLazyCounter, 14862 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 25749 SdHoareTripleChecker+Invalid, 15719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 14862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:37,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1613 Valid, 25749 Invalid, 15719 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 14862 Invalid, 0 Unknown, 786 Unchecked, 28.1s Time] [2022-11-03 01:47:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2022-11-03 01:47:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1026. [2022-11-03 01:47:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 670 states have (on average 1.6582089552238806) internal successors, (1111), 1019 states have internal predecessors, (1111), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:47:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1138 transitions. [2022-11-03 01:47:37,036 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1138 transitions. Word has length 93 [2022-11-03 01:47:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:37,036 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1138 transitions. [2022-11-03 01:47:37,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.1272727272727274) internal successors, (172), 55 states have internal predecessors, (172), 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-03 01:47:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1138 transitions. [2022-11-03 01:47:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-03 01:47:37,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:37,038 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:37,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:37,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-11-03 01:47:37,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-03 01:47:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:37,647 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:47:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1176958411, now seen corresponding path program 1 times [2022-11-03 01:47:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:47:37,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734279368] [2022-11-03 01:47:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:37,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:47:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:47:37,650 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:47:37,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 01:47:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:38,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 01:47:38,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:39,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:46,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:47:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734279368] [2022-11-03 01:47:46,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734279368] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1773158970] [2022-11-03 01:47:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:47:46,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:47:46,330 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:47:46,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-03 01:47:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:47,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 01:47:47,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:47,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:49,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1773158970] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:49,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117673575] [2022-11-03 01:47:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:49,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:49,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:49,012 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:49,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 01:47:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:49,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:47:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:49,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:48:03,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117673575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:48:03,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:48:03,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2022-11-03 01:48:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096283564] [2022-11-03 01:48:03,160 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:48:03,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-03 01:48:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:48:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-03 01:48:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2022-11-03 01:48:03,167 INFO L87 Difference]: Start difference. First operand 1026 states and 1138 transitions. Second operand has 131 states, 131 states have (on average 1.5572519083969465) internal successors, (204), 131 states have internal predecessors, (204), 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-03 01:50:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:46,275 INFO L93 Difference]: Finished difference Result 1185 states and 1369 transitions. [2022-11-03 01:50:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-11-03 01:50:46,277 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5572519083969465) internal successors, (204), 131 states have internal predecessors, (204), 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 117 [2022-11-03 01:50:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:46,281 INFO L225 Difference]: With dead ends: 1185 [2022-11-03 01:50:46,281 INFO L226 Difference]: Without dead ends: 1179 [2022-11-03 01:50:46,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7492 ImplicationChecksByTransitivity, 163.8s TimeCoverageRelationStatistics Valid=18423, Invalid=46857, Unknown=0, NotChecked=0, Total=65280 [2022-11-03 01:50:46,299 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 1162 mSDsluCounter, 41178 mSDsCounter, 0 mSdLazyCounter, 7061 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 42098 SdHoareTripleChecker+Invalid, 8548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 7061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:46,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 42098 Invalid, 8548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1487 Valid, 7061 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2022-11-03 01:50:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-03 01:50:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1101. [2022-11-03 01:50:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 745 states have (on average 1.6348993288590603) internal successors, (1218), 1094 states have internal predecessors, (1218), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:50:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1245 transitions. [2022-11-03 01:50:46,323 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1245 transitions. Word has length 117 [2022-11-03 01:50:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:46,324 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1245 transitions. [2022-11-03 01:50:46,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5572519083969465) internal successors, (204), 131 states have internal predecessors, (204), 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-03 01:50:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1245 transitions. [2022-11-03 01:50:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-03 01:50:46,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:46,326 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, 1] [2022-11-03 01:50:46,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:46,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-11-03 01:50:46,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-11-03 01:50:46,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:46,938 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:50:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash -629568776, now seen corresponding path program 2 times [2022-11-03 01:50:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:50:46,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464862914] [2022-11-03 01:50:46,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:50:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:50:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:50:46,941 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:50:46,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-03 01:50:47,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 01:50:47,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:50:47,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 01:50:47,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:47,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:47,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:48,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:48,324 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:50:48,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:48,931 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 01:50:48,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 36 [2022-11-03 01:50:48,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:48,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2022-11-03 01:50:49,189 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 01:50:49,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-03 01:50:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-03 01:50:49,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:50:49,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:50:49,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464862914] [2022-11-03 01:50:49,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464862914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:49,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:49,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:50:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092144371] [2022-11-03 01:50:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:49,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:50:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:50:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:50:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:50:49,231 INFO L87 Difference]: Start difference. First operand 1101 states and 1245 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 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-03 01:50:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:56,839 INFO L93 Difference]: Finished difference Result 2100 states and 2425 transitions. [2022-11-03 01:50:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:50:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 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 120 [2022-11-03 01:50:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:56,848 INFO L225 Difference]: With dead ends: 2100 [2022-11-03 01:50:56,848 INFO L226 Difference]: Without dead ends: 2100 [2022-11-03 01:50:56,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:50:56,849 INFO L413 NwaCegarLoop]: 1064 mSDtfsCounter, 1051 mSDsluCounter, 2812 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 4792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2250 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:56,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 3876 Invalid, 4792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2533 Invalid, 0 Unknown, 2250 Unchecked, 7.5s Time] [2022-11-03 01:50:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-11-03 01:50:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1100. [2022-11-03 01:50:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 745 states have (on average 1.6335570469798657) internal successors, (1217), 1093 states have internal predecessors, (1217), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:50:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1244 transitions. [2022-11-03 01:50:56,878 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1244 transitions. Word has length 120 [2022-11-03 01:50:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:56,879 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1244 transitions. [2022-11-03 01:50:56,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 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-03 01:50:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1244 transitions. [2022-11-03 01:50:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-03 01:50:56,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:56,881 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, 1] [2022-11-03 01:50:56,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-11-03 01:50:57,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:50:57,097 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:50:57,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash -629568775, now seen corresponding path program 1 times [2022-11-03 01:50:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:50:57,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494926654] [2022-11-03 01:50:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:57,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:50:57,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:50:57,100 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:50:57,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-03 01:50:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:58,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 01:50:58,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:58,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,369 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:50:58,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:58,697 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4670 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4670) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4669 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4669) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:50:58,724 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4672) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4671 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4671)))) is different from true [2022-11-03 01:50:58,740 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4673) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4674) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:58,754 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4676 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4676))) (exists ((v_ArrVal_4675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4675)))) is different from true [2022-11-03 01:50:58,770 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4677) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4678) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:50:58,788 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4679))) (exists ((v_ArrVal_4680 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4680)))) is different from true [2022-11-03 01:50:58,867 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4683))) (exists ((v_ArrVal_4684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684)))) is different from true [2022-11-03 01:50:58,887 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4685 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4685))) (exists ((v_ArrVal_4686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4686) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:58,905 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4687))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4688 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4688)))) is different from true [2022-11-03 01:50:58,922 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4690 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4690))) (exists ((v_ArrVal_4689 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4689))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:50:58,940 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4691 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4691))) (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:50:58,959 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693))) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694)))) is different from true [2022-11-03 01:50:58,976 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2022-11-03 01:50:58,993 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:59,011 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:59,030 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702))) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701)))) is different from true [2022-11-03 01:50:59,048 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4703))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704)))) is different from true [2022-11-03 01:50:59,067 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706)))) is different from true [2022-11-03 01:50:59,086 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707)))) is different from true [2022-11-03 01:50:59,104 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709)))) is different from true [2022-11-03 01:50:59,123 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:50:59,151 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:50:59,217 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:59,233 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719))) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:59,248 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:59,265 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4723)))) is different from true [2022-11-03 01:50:59,330 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728)))) is different from true [2022-11-03 01:50:59,356 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729)))) is different from true [2022-11-03 01:50:59,374 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732)))) is different from true [2022-11-03 01:50:59,394 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734)))) is different from true [2022-11-03 01:50:59,412 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:50:59,429 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:59,445 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739)))) is different from true [2022-11-03 01:50:59,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742)))) is different from true [2022-11-03 01:50:59,477 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744)))) is different from true [2022-11-03 01:50:59,492 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746)))) is different from true [2022-11-03 01:50:59,523 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747)))) is different from true [2022-11-03 01:50:59,543 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749)))) is different from true [2022-11-03 01:50:59,560 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752)))) is different from true [2022-11-03 01:50:59,577 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-11-03 01:50:59,639 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:59,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:59,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:59,806 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:59,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:59,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:59,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:59,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:50:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-11-03 01:50:59,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:00,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-03 01:51:00,225 WARN L833 $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_4755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-03 01:51:01,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4848))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4847) .cse0 v_ArrVal_4756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4847) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 01:51:01,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:51:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494926654] [2022-11-03 01:51:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494926654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1106742146] [2022-11-03 01:51:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:01,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:51:01,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:51:01,448 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:51:01,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-03 01:51:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:06,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 01:51:06,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:06,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:06,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:07,199 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:51:07,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:07,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:07,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:07,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:07,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:07,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:08,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:08,332 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:08,346 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,186 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,703 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,818 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,931 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ 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_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,945 WARN L855 $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_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:09,959 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:10,260 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:10,275 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ 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|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:10,495 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:11,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:11,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:11,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:11,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:11,402 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 01:51:11,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:11,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:51:11,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-03 01:51:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 465 trivial. 494 not checked. [2022-11-03 01:51:11,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:12,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:25,059 WARN L234 SmtUtils]: Spent 11.36s on a formula simplification. DAG size of input: 64 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:51:25,568 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5324))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_5275 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_56 (store (select .cse1 v_arrayElimCell_56) (bvadd (_ bv16 32) .cse2) v_ArrVal_5275)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_56))))))) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5324))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_56))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse4 v_arrayElimCell_56 (store (select .cse4 v_arrayElimCell_56) (bvadd (_ bv16 32) .cse5) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse6) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))))) is different from false [2022-11-03 01:51:25,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1106742146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:25,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487837585] [2022-11-03 01:51:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:25,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:25,593 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:25,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 01:51:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:26,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 01:51:26,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:26,728 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:51:26,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:26,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:26,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:26,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:26,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:26,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:26,955 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5706))) (exists ((v_ArrVal_5705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5705) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:51:26,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5708 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5708))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5707) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:26,991 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5709) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5710) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:27,008 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5712))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5711)))) is different from true [2022-11-03 01:51:27,026 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5714))) (exists ((v_ArrVal_5713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5713)))) is different from true [2022-11-03 01:51:27,065 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5716) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:27,087 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5718))) (exists ((v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5717)))) is different from true [2022-11-03 01:51:27,108 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5719))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:51:27,130 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5722))) (exists ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5721)))) is different from true [2022-11-03 01:51:27,152 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5723))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5724) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:27,173 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5726) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5725)))) is different from true [2022-11-03 01:51:27,196 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5727))) (exists ((v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5728))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:51:27,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5730) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5729)))) is different from true [2022-11-03 01:51:27,237 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5732))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5731)))) is different from true [2022-11-03 01:51:27,259 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5733))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5734) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:27,305 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5736))) (exists ((v_ArrVal_5735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5735) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:51:27,324 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5738) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5737)))) is different from true [2022-11-03 01:51:27,346 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5740) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5739) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:27,367 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5742))) (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5741)))) is different from true [2022-11-03 01:51:27,389 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5744) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5743)))) is different from true [2022-11-03 01:51:27,411 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5746))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5745)))) is different from true [2022-11-03 01:51:27,431 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5748))) (exists ((v_ArrVal_5747 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5747) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:27,452 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5749))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5750)))) is different from true [2022-11-03 01:51:27,474 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5752) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5751)))) is different from true [2022-11-03 01:51:27,492 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5753))) (exists ((v_ArrVal_5754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5754)))) is different from true [2022-11-03 01:51:27,510 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5756)))) is different from true [2022-11-03 01:51:27,527 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5757))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5758)))) is different from true [2022-11-03 01:51:27,544 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5759))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5760) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:27,562 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5761))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5762)))) is different from true [2022-11-03 01:51:27,580 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5763) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5764)))) is different from true [2022-11-03 01:51:27,598 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5766))) (exists ((v_ArrVal_5765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5765)))) is different from true [2022-11-03 01:51:27,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5768)))) is different from true [2022-11-03 01:51:27,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5769))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5770) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:27,652 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5772))) (exists ((v_ArrVal_5771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5771) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:27,679 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5774) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5773)))) is different from true [2022-11-03 01:51:27,699 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5775))) (exists ((v_ArrVal_5776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5776)))) is different from true [2022-11-03 01:51:27,717 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5777))) (exists ((v_ArrVal_5778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5778)))) is different from true [2022-11-03 01:51:27,735 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5779))) (exists ((v_ArrVal_5780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5780)))) is different from true [2022-11-03 01:51:27,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5782) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5781) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:27,773 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5783))) (exists ((v_ArrVal_5784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5784))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:51:27,791 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5786) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5785) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:27,809 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5788))) (exists ((v_ArrVal_5787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5787))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2022-11-03 01:51:27,825 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5790)))) is different from true [2022-11-03 01:51:27,844 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5792) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5791)))) is different from true [2022-11-03 01:51:27,919 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:27,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:27,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:28,057 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:28,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:28,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:28,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:28,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:28,129 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-03 01:51:28,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:28,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 01:51:28,266 WARN L833 $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_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 01:51:29,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5885))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5886) .cse0 v_ArrVal_5794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5886) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 01:51:29,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487837585] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:29,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:29,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 24, 53] total 117 [2022-11-03 01:51:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326281293] [2022-11-03 01:51:29,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:29,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-11-03 01:51:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:51:29,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-11-03 01:51:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=600, Unknown=137, NotChecked=15496, Total=16512 [2022-11-03 01:51:29,471 INFO L87 Difference]: Start difference. First operand 1100 states and 1244 transitions. Second operand has 118 states, 115 states have (on average 2.4956521739130433) internal successors, (287), 118 states have internal predecessors, (287), 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-03 01:51:30,795 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5706))) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5705) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4668 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4668))) (exists ((v_ArrVal_4667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4667))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32)))) is different from true [2022-11-03 01:51:30,805 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4670 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4670) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5708 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5708))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (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_4669 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4669) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5707) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4683))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_4684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684))) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:30,817 WARN L855 $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_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719))) (exists ((v_ArrVal_4685 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4685))) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (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_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4672) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_4671 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4671))) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4686) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5710) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:30,831 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5712))) (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_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_ArrVal_4687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4687))) (exists ((v_ArrVal_4673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4673) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4688 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4688))) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (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_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4674) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5711))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:30,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4690 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4690))) (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_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4689 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4689))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_4676 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4676))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5714))) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (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_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734))) (exists ((v_ArrVal_5713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5713))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4723))) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4675)))) is different from true [2022-11-03 01:51:30,857 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4691 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4691))) (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_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4677) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4678) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4668 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4668))) (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_5716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4667))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:31,272 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.offset|)) (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_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_5720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4670 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4670) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_5719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5719))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.base|)) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719))) (exists ((v_ArrVal_4685 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4685))) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4668 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4668))) (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_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_ArrVal_4669 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4669) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4672) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4683))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_ArrVal_4667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4667))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_4671 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4671))) (exists ((v_ArrVal_4684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684))) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_4686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4686) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:31,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.offset|)) (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_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_4|) (_ bv44 32))) (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4687))) (exists ((v_ArrVal_4670 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4670) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4673) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.base|)) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4688 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4688))) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719))) (exists ((v_ArrVal_4685 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4685))) (exists ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_$Pointer$.offset|)) (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_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4669 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4669) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4672) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5722))) (exists ((v_ArrVal_4683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4683))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5721))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238))) (exists ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4674) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|) (_ bv40 32))) (exists ((v_ArrVal_4671 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4671))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684))) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4686) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:47,703 INFO L93 Difference]: Finished difference Result 2177 states and 2573 transitions. [2022-11-03 01:51:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:51:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 115 states have (on average 2.4956521739130433) internal successors, (287), 118 states have internal predecessors, (287), 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 120 [2022-11-03 01:51:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:47,709 INFO L225 Difference]: With dead ends: 2177 [2022-11-03 01:51:47,710 INFO L226 Difference]: Without dead ends: 2177 [2022-11-03 01:51:47,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 216 SyntacticMatches, 37 SemanticMatches, 143 ConstructedPredicates, 112 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=368, Invalid=965, Unknown=171, NotChecked=19376, Total=20880 [2022-11-03 01:51:47,713 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 1782 mSDsluCounter, 6753 mSDsCounter, 0 mSdLazyCounter, 5344 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 7536 SdHoareTripleChecker+Invalid, 168856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163487 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:47,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 7536 Invalid, 168856 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 5344 Invalid, 0 Unknown, 163487 Unchecked, 16.1s Time] [2022-11-03 01:51:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2022-11-03 01:51:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1099. [2022-11-03 01:51:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 745 states have (on average 1.632214765100671) internal successors, (1216), 1092 states have internal predecessors, (1216), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:51:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1243 transitions. [2022-11-03 01:51:47,742 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1243 transitions. Word has length 120 [2022-11-03 01:51:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:47,743 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1243 transitions. [2022-11-03 01:51:47,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 115 states have (on average 2.4956521739130433) internal successors, (287), 118 states have internal predecessors, (287), 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-03 01:51:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1243 transitions. [2022-11-03 01:51:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-03 01:51:47,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:47,745 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, 1, 1, 1, 1] [2022-11-03 01:51:47,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-11-03 01:51:47,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-11-03 01:51:48,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-11-03 01:51:48,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:51:48,362 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:51:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 639071765, now seen corresponding path program 1 times [2022-11-03 01:51:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:51:48,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112206247] [2022-11-03 01:51:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:51:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:51:48,364 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:51:48,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-03 01:51:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:49,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 01:51:49,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:49,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:49,987 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:51:49,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:50,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:50,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:51,010 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (exists ((v_ArrVal_6294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6294)))) is different from true [2022-11-03 01:51:52,389 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6320)))) is different from true [2022-11-03 01:51:52,683 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:52,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:52,837 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:52,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:52,967 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:52,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:53,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:51:53,059 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-03 01:51:53,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:53,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6326) |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-03 01:51:53,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6326 (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_6326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:51:53,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6325))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:51:53,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6326 (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_6325))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:51:53,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6326 (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~mem38#1.base| v_ArrVal_6372))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6325)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-03 01:51:53,664 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:51:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112206247] [2022-11-03 01:51:53,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112206247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [475009418] [2022-11-03 01:51:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:51:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:51:53,667 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:51:53,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-03 01:52:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:22,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-03 01:52:22,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:22,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:22,867 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:52:22,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:22,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:22,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:23,182 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (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-03 01:52:23,562 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (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-03 01:52:23,809 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (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-03 01:52:24,012 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (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-03 01:52:24,087 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (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-03 01:52:24,568 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (exists ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6798) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:24,700 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (exists ((v_ArrVal_6801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6801) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:25,236 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:25,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:25,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:25,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:25,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:25,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:25,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:25,451 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-03 01:52:25,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:25,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6812) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-03 01:52:25,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6812 (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_6812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:52:25,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6811))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6812)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:52:25,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (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_6811))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6812)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:52:25,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6858))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6811)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6812)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:52:25,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [475009418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:25,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029303444] [2022-11-03 01:52:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:25,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:25,948 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:25,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 01:52:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:26,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 01:52:26,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:27,136 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:52:27,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:27,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:30,195 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:30,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:30,400 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:30,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:30,545 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:30,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:30,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:30,584 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-03 01:52:30,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:30,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7296 (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_7296) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:52:30,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7296 (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~mem40#1.base| v_ArrVal_7295))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7296)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 01:52:30,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7296 (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_7295))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7296)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:52:31,206 INFO L356 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-03 01:52:31,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 60 [2022-11-03 01:52:31,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7342))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7295)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7296)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2022-11-03 01:52:31,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029303444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:31,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:52:31,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 13] total 30 [2022-11-03 01:52:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290995086] [2022-11-03 01:52:31,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:52:31,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:52:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:52:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:52:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=464, Unknown=51, NotChecked=1518, Total=2162 [2022-11-03 01:52:31,230 INFO L87 Difference]: Start difference. First operand 1099 states and 1243 transitions. Second operand has 31 states, 28 states have (on average 5.285714285714286) internal successors, (148), 30 states have internal predecessors, (148), 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-03 01:52:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:46,427 INFO L93 Difference]: Finished difference Result 2178 states and 2573 transitions. [2022-11-03 01:52:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:52:46,428 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 5.285714285714286) internal successors, (148), 30 states have internal predecessors, (148), 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 123 [2022-11-03 01:52:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:46,431 INFO L225 Difference]: With dead ends: 2178 [2022-11-03 01:52:46,431 INFO L226 Difference]: Without dead ends: 2178 [2022-11-03 01:52:46,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 229 SyntacticMatches, 125 SemanticMatches, 53 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=192, Invalid=832, Unknown=60, NotChecked=1886, Total=2970 [2022-11-03 01:52:46,433 INFO L413 NwaCegarLoop]: 893 mSDtfsCounter, 1367 mSDsluCounter, 7888 mSDsCounter, 0 mSdLazyCounter, 4847 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 8781 SdHoareTripleChecker+Invalid, 20186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15297 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:46,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 8781 Invalid, 20186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 4847 Invalid, 0 Unknown, 15297 Unchecked, 14.4s Time] [2022-11-03 01:52:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2022-11-03 01:52:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1098. [2022-11-03 01:52:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 745 states have (on average 1.6308724832214765) internal successors, (1215), 1091 states have internal predecessors, (1215), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:52:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1242 transitions. [2022-11-03 01:52:46,459 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1242 transitions. Word has length 123 [2022-11-03 01:52:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:46,459 INFO L495 AbstractCegarLoop]: Abstraction has 1098 states and 1242 transitions. [2022-11-03 01:52:46,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 5.285714285714286) internal successors, (148), 30 states have internal predecessors, (148), 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-03 01:52:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1242 transitions. [2022-11-03 01:52:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-03 01:52:46,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:46,462 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, 1, 1, 1, 1] [2022-11-03 01:52:46,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:46,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:46,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-11-03 01:52:47,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:47,086 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:52:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 639071766, now seen corresponding path program 1 times [2022-11-03 01:52:47,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:52:47,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215958572] [2022-11-03 01:52:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:47,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:52:47,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:52:47,088 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:52:47,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-03 01:52:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:48,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 01:52:48,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:48,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:48,757 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:52:48,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:48,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:48,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:48,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:48,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:48,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:49,070 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740)))) is different from true [2022-11-03 01:52:49,089 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:49,242 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747)))) is different from true [2022-11-03 01:52:49,261 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750)))) is different from true [2022-11-03 01:52:49,281 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751)))) is different from true [2022-11-03 01:52:49,300 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754)))) is different from true [2022-11-03 01:52:49,449 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:49,469 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:49,491 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764)))) is different from true [2022-11-03 01:52:49,510 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765)))) is different from true [2022-11-03 01:52:49,572 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770)))) is different from true [2022-11-03 01:52:49,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773)))) is different from true [2022-11-03 01:52:49,651 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:49,668 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778)))) is different from true [2022-11-03 01:52:49,684 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779)))) is different from true [2022-11-03 01:52:49,700 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781)))) is different from true [2022-11-03 01:52:49,716 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:49,914 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (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|))) is different from true [2022-11-03 01:52:49,931 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (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_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796)))) is different from true [2022-11-03 01:52:49,990 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (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_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32)))) is different from true [2022-11-03 01:52:50,144 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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_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-03 01:52:50,166 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810)))) is different from true [2022-11-03 01:52:50,183 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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))) (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-03 01:52:50,209 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (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-03 01:52:50,226 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815)))) is different from true [2022-11-03 01:52:50,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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-03 01:52:50,303 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821)))) is different from true [2022-11-03 01:52:50,320 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (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-03 01:52:50,436 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:50,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,604 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:50,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,762 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:50,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:52:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-11-03 01:52:50,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:51,223 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7829) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 01:52:51,275 WARN L833 $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_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7829) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 01:52:51,393 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7828))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7827) .cse0 v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7829) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7827) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 01:52:51,506 WARN L833 $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_7829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7828))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7827) .cse1 v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7829) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7827) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-03 01:52:53,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7922))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7921) .cse1 v_ArrVal_7827) (select (select (store .cse2 .cse1 v_ArrVal_7828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7830))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7922))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7828))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7921) .cse4 v_ArrVal_7827) .cse5 v_ArrVal_7830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7829) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 01:52:53,757 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:52:53,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215958572] [2022-11-03 01:52:53,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215958572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:53,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [832785269] [2022-11-03 01:52:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:53,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:52:53,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:52:53,759 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:52:53,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-03 01:57:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:53,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 01:57:53,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:53,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,498 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:57:53,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:53,861 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319)))) is different from true [2022-11-03 01:57:54,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:57:54,075 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328)))) is different from true [2022-11-03 01:57:54,102 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329)))) is different from true [2022-11-03 01:57:54,130 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332)))) is different from true [2022-11-03 01:57:54,229 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335)))) is different from true [2022-11-03 01:57:54,256 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337)))) is different from true [2022-11-03 01:57:54,286 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339)))) is different from true [2022-11-03 01:57:54,476 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345)))) is different from true [2022-11-03 01:57:54,512 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348)))) is different from true [2022-11-03 01:57:54,547 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349)))) is different from true [2022-11-03 01:57:54,678 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:57:54,715 WARN L855 $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_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355)))) is different from true [2022-11-03 01:57:54,933 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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)))) is different from true [2022-11-03 01:57:54,971 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364)))) is different from true [2022-11-03 01:57:55,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365)))) is different from true [2022-11-03 01:57:55,041 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368)))) is different from true [2022-11-03 01:57:55,408 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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-03 01:57:55,439 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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)))) is different from true [2022-11-03 01:57:55,470 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382)))) is different from true [2022-11-03 01:57:55,643 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:57:55,673 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:57:55,704 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:57:55,732 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:57:55,763 WARN L855 $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_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:57:55,861 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ 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_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:57:55,889 WARN L855 $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_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:57:55,986 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (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))) (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-03 01:57:56,071 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:57:56,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,243 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:57:56,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,390 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:57:56,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:57:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-11-03 01:57:56,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:56,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 01:57:56,648 WARN L833 $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_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 01:57:56,759 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8408))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8407) .cse0 v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8407) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 01:57:56,945 WARN L833 $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_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8407) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8408))) (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_8407) .cse3 v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-03 01:57:59,609 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8501))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8502) .cse1 v_ArrVal_8407) (select (select (store .cse2 .cse1 v_ArrVal_8408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8410))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8501))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8408))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8502) .cse4 v_ArrVal_8407) .cse5 v_ArrVal_8410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 01:57:59,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [832785269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:59,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099535843] [2022-11-03 01:57:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:59,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:59,634 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:59,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 01:58:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:00,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-03 01:58:00,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:00,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:01,036 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:58:01,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:01,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:01,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:01,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:01,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:01,350 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898)))) is different from true [2022-11-03 01:58:01,379 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8901 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8901) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:58:01,483 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904)))) is different from true [2022-11-03 01:58:01,513 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907))) (exists ((v_ArrVal_8906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8906)))) is different from true [2022-11-03 01:58:01,613 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:58:01,718 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915)))) is different from true [2022-11-03 01:58:01,828 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918)))) is different from true [2022-11-03 01:58:01,858 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8921))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920)))) is different from true [2022-11-03 01:58:01,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8922))) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923)))) is different from true [2022-11-03 01:58:01,926 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8925)))) is different from true [2022-11-03 01:58:02,072 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929)))) is different from true [2022-11-03 01:58:02,104 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8930) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:58:02,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8933)))) is different from true [2022-11-03 01:58:02,163 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8935))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (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-03 01:58:02,194 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8937) |c_#memory_$Pointer$.offset|)) (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-03 01:58:02,223 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8938)))) is different from true [2022-11-03 01:58:02,330 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:58:02,376 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8945) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944)))) is different from true [2022-11-03 01:58:02,414 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8946))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947)))) is different from true [2022-11-03 01:58:02,537 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:58:02,575 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952)))) is different from true [2022-11-03 01:58:02,609 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954)))) is different from true [2022-11-03 01:58:02,639 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:58:02,667 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959)))) is different from true [2022-11-03 01:58:02,774 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (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_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:58:02,802 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965)))) is different from true [2022-11-03 01:58:02,910 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:58:03,017 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972)))) is different from true [2022-11-03 01:58:03,053 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975))) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974)))) is different from true [2022-11-03 01:58:03,084 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8976) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:58:03,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981)))) is different from true [2022-11-03 01:58:03,223 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983)))) is different from true [2022-11-03 01:58:03,252 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32)))) is different from true [2022-11-03 01:58:03,365 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:03,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,531 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:03,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:03,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 924 not checked. [2022-11-03 01:58:03,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:03,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8988) |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~mem41#1.base| v_ArrVal_8989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-03 01:58:03,946 WARN L833 $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_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 01:58:04,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8987))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8986) .cse0 v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8986) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 01:58:04,134 WARN L833 $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_8989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8987))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8986) .cse1 v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8986) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-03 01:58:05,910 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9081))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8987))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9080) .cse0 v_ArrVal_8986) .cse1 v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9081))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9080) .cse6 v_ArrVal_8986) (select (select (store .cse7 .cse6 v_ArrVal_8987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8988))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2022-11-03 01:58:05,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099535843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:05,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:05,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 44] total 100 [2022-11-03 01:58:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530254682] [2022-11-03 01:58:05,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:05,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-11-03 01:58:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:58:05,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-11-03 01:58:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=245, Unknown=112, NotChecked=13208, Total=13806 [2022-11-03 01:58:05,933 INFO L87 Difference]: Start difference. First operand 1098 states and 1242 transitions. Second operand has 101 states, 99 states have (on average 2.323232323232323) internal successors, (230), 101 states have internal predecessors, (230), 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-03 01:58:07,257 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_8320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319)))) is different from true [2022-11-03 01:58:07,311 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (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_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (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_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (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_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904))) (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_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |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_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (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))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (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|)) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918))) (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))) (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))) (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-03 01:58:07,335 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (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_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_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (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_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (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_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_8921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8921))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (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_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_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904))) (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_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_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |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_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (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))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (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_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (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|)) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_8930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8930) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918))) (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))) (exists ((v_ArrVal_8906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8906))) (exists ((v_ArrVal_8945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8945) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (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))) (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-03 01:58:07,362 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (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_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_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (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_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977))) (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (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_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_ArrVal_8921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8921))) (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (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_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_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_8976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8976) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_8946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8946))) (exists ((v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904))) (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_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (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_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |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_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))) (exists ((v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (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))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8922))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (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_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (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|)) (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))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_8930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8930) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8933))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (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))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918))) (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))) (exists ((v_ArrVal_8906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8906))) (exists ((v_ArrVal_8945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8945) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954))) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (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))) (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-03 01:58:07,395 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8935))) (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.base|)) (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_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_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (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_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977))) (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (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_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_ArrVal_8921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8921))) (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (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_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_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_8976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8976) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_8946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8946))) (exists ((v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904))) (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_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (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_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (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_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (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))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_8922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8922))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (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_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (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|)) (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))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_8930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8930) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8933))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8925))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (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))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918))) (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))) (exists ((v_ArrVal_8906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8906))) (exists ((v_ArrVal_8945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8945) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954))) (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))) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (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))) (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-03 01:58:07,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8935))) (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.base|)) (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_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_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (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_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977))) (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.offset|)) (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_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_8937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8937) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (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_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_ArrVal_8921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8921))) (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (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_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (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_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_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_8976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8976) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_8946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8946))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (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_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (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_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (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_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (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))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_8922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8922))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (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_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (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|)) (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))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_8930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8930) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8933))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8925))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (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_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (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))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918))) (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))) (exists ((v_ArrVal_8906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8906))) (exists ((v_ArrVal_8945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8945) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954))) (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))) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (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))) (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-03 01:58:07,467 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8935))) (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.base|)) (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_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_ArrVal_8911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8911))) (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (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_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977))) (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.offset|)) (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_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_8937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8937) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (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_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_ArrVal_8921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8921))) (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (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_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769))) (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_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_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_8976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8976) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8905) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (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_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_8946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8946))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8904))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (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_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (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_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (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_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972))) (exists ((v_ArrVal_8929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8929))) (exists ((v_ArrVal_8938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8938))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (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))) (exists ((v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_8922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8922))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (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_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (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|)) (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))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_8930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8930) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8933))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8925))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981))) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (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_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (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))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_8918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8918))) (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))) (exists ((v_ArrVal_8906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8906))) (exists ((v_ArrVal_8945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8945) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954))) (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))) (exists ((v_ArrVal_8944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8944))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (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))) (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-03 01:58:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:29,546 INFO L93 Difference]: Finished difference Result 2173 states and 2567 transitions. [2022-11-03 01:58:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 01:58:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 99 states have (on average 2.323232323232323) internal successors, (230), 101 states have internal predecessors, (230), 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 123 [2022-11-03 01:58:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:29,552 INFO L225 Difference]: With dead ends: 2173 [2022-11-03 01:58:29,552 INFO L226 Difference]: Without dead ends: 2173 [2022-11-03 01:58:29,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 234 SyntacticMatches, 49 SemanticMatches, 133 ConstructedPredicates, 111 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=327, Invalid=541, Unknown=128, NotChecked=17094, Total=18090 [2022-11-03 01:58:29,554 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 1344 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 4543 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 4832 SdHoareTripleChecker+Invalid, 131272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126700 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:29,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 4832 Invalid, 131272 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 4543 Invalid, 0 Unknown, 126700 Unchecked, 22.0s Time] [2022-11-03 01:58:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2022-11-03 01:58:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1097. [2022-11-03 01:58:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 745 states have (on average 1.6295302013422819) internal successors, (1214), 1090 states have internal predecessors, (1214), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-03 01:58:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1241 transitions. [2022-11-03 01:58:29,577 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1241 transitions. Word has length 123 [2022-11-03 01:58:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:29,578 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1241 transitions. [2022-11-03 01:58:29,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 99 states have (on average 2.323232323232323) internal successors, (230), 101 states have internal predecessors, (230), 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-03 01:58:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1241 transitions. [2022-11-03 01:58:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-03 01:58:29,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:29,580 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:29,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-11-03 01:58:29,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:30,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 01:58:30,195 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-03 01:58:30,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1002769153, now seen corresponding path program 1 times [2022-11-03 01:58:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:58:30,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309113947] [2022-11-03 01:58:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:58:30,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:58:30,198 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:58:30,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-03 01:58:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:31,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-03 01:58:31,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:31,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:32,372 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:58:32,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:32,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:32,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:36,514 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:36,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:36,759 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:36,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:36,980 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:36,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:37,199 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:37,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:37,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:58:37,358 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-03 01:58:37,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:37,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9537 (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_9537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-03 01:58:37,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:58:37,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9536 (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_9536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:58:37,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9535 (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~mem40#1.base| v_ArrVal_9535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:58:37,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9535 (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_9535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:58:38,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9535 (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~mem38#1.base| v_ArrVal_9583))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9535)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:58:38,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:58:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309113947] [2022-11-03 01:58:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309113947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726475282] [2022-11-03 01:58:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:58:38,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:58:38,409 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:58:38,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d15fc86c-f392-4e1f-849a-a9e808630802/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process