./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7 --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 14558cb0aef5bf60b4a230892060936885d87372f6515d5d8ad78f7b805ad735 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:34:43,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:34:43,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:34:43,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:34:43,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:34:43,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:34:43,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:34:43,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:34:43,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:34:43,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:34:43,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:34:43,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:34:43,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:34:43,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:34:43,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:34:43,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:34:43,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:34:43,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:34:43,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:34:43,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:34:43,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:34:43,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:34:43,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:34:43,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:34:43,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:34:43,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:34:43,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:34:43,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:34:43,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:34:43,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:34:43,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:34:43,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:34:43,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:34:43,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:34:43,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:34:43,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:34:43,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:34:43,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:34:43,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:34:43,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:34:43,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:34:43,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-25 19:34:43,668 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:34:43,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:34:43,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:34:43,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:34:43,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:34:43,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:34:43,678 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:34:43,678 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:34:43,679 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:34:43,679 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:34:43,680 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:34:43,680 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:34:43,681 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:34:43,681 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:34:43,681 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:34:43,681 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:34:43,682 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:34:43,682 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:34:43,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 19:34:43,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 19:34:43,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:34:43,684 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:34:43,684 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:34:43,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:34:43,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:34:43,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:34:43,686 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 19:34:43,687 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 19:34:43,687 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 19:34:43,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:34:43,688 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 19:34:43,688 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:34:43,688 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:34:43,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:34:43,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:34:43,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:34:43,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:34:43,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:34:43,690 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:34:43,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:34:43,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:34:43,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:34:43,691 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7 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 -> 14558cb0aef5bf60b4a230892060936885d87372f6515d5d8ad78f7b805ad735 [2021-11-25 19:34:43,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:34:44,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:34:44,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:34:44,038 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:34:44,038 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:34:44,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i [2021-11-25 19:34:44,124 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/497b69a15/e3b43b4e3a9e48c7905dfda62cb6c8d7/FLAG2dade9178 [2021-11-25 19:34:44,923 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:34:44,924 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i [2021-11-25 19:34:44,945 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/497b69a15/e3b43b4e3a9e48c7905dfda62cb6c8d7/FLAG2dade9178 [2021-11-25 19:34:45,127 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/497b69a15/e3b43b4e3a9e48c7905dfda62cb6c8d7 [2021-11-25 19:34:45,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:34:45,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:34:45,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:34:45,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:34:45,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:34:45,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:34:45" (1/1) ... [2021-11-25 19:34:45,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adc838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:45, skipping insertion in model container [2021-11-25 19:34:45,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:34:45" (1/1) ... [2021-11-25 19:34:45,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:34:45,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:34:45,843 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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i[33022,33035] [2021-11-25 19:34:46,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:34:46,175 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-25 19:34:46,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b40230f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:46, skipping insertion in model container [2021-11-25 19:34:46,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:34:46,176 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-25 19:34:46,178 INFO L158 Benchmark]: Toolchain (without parser) took 1043.41ms. Allocated memory is still 121.6MB. Free memory was 90.3MB in the beginning and 76.5MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 19:34:46,179 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:34:46,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1038.71ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 76.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 19:34:46,182 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.30ms. Allocated memory is still 121.6MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1038.71ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 76.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7 --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 14558cb0aef5bf60b4a230892060936885d87372f6515d5d8ad78f7b805ad735 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:34:48,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:34:48,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:34:48,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:34:48,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:34:48,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:34:48,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:34:48,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:34:48,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:34:48,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:34:48,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:34:48,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:34:48,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:34:48,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:34:48,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:34:48,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:34:48,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:34:48,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:34:48,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:34:48,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:34:48,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:34:48,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:34:48,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:34:48,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:34:48,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:34:48,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:34:48,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:34:48,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:34:48,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:34:48,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:34:48,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:34:48,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:34:48,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:34:48,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:34:48,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:34:48,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:34:48,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:34:48,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:34:48,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:34:48,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:34:48,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:34:48,624 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-25 19:34:48,678 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:34:48,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:34:48,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:34:48,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:34:48,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:34:48,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:34:48,681 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:34:48,682 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:34:48,682 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:34:48,682 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:34:48,683 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:34:48,684 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:34:48,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 19:34:48,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 19:34:48,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:34:48,686 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:34:48,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:34:48,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:34:48,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:34:48,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:34:48,687 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 19:34:48,688 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 19:34:48,688 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 19:34:48,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:34:48,688 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 19:34:48,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 19:34:48,689 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 19:34:48,689 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:34:48,689 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:34:48,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:34:48,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 19:34:48,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:34:48,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:34:48,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:34:48,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:34:48,692 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 19:34:48,692 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 19:34:48,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:34:48,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:34:48,693 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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7 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 -> 14558cb0aef5bf60b4a230892060936885d87372f6515d5d8ad78f7b805ad735 [2021-11-25 19:34:49,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:34:49,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:34:49,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:34:49,256 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:34:49,257 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:34:49,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i [2021-11-25 19:34:49,343 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/5cc1a17a3/f233a76df33b4e8eabca91812220ca25/FLAG0772c88a6 [2021-11-25 19:34:50,163 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:34:50,164 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i [2021-11-25 19:34:50,188 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/5cc1a17a3/f233a76df33b4e8eabca91812220ca25/FLAG0772c88a6 [2021-11-25 19:34:50,275 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/data/5cc1a17a3/f233a76df33b4e8eabca91812220ca25 [2021-11-25 19:34:50,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:34:50,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:34:50,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:34:50,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:34:50,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:34:50,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:34:50" (1/1) ... [2021-11-25 19:34:50,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfd0229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:50, skipping insertion in model container [2021-11-25 19:34:50,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:34:50" (1/1) ... [2021-11-25 19:34:50,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:34:50,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:34:50,856 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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i[33022,33035] [2021-11-25 19:34:51,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:34:51,232 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-25 19:34:51,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:34:51,316 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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i[33022,33035] [2021-11-25 19:34:51,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:34:51,519 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:34:51,551 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_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-2.i[33022,33035] [2021-11-25 19:34:51,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:34:51,795 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:34:51,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51 WrapperNode [2021-11-25 19:34:51,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:34:51,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:34:51,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:34:51,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:34:51,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:51,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,039 INFO L137 Inliner]: procedures = 180, calls = 575, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2348 [2021-11-25 19:34:52,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:34:52,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:34:52,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:34:52,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:34:52,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:34:52,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:34:52,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:34:52,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:34:52,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (1/1) ... [2021-11-25 19:34:52,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:34:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:52,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:34:52,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:34:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-25 19:34:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2021-11-25 19:34:52,418 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2021-11-25 19:34:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-25 19:34:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-25 19:34:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-25 19:34:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-25 19:34:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-25 19:34:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 19:34:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:34:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 19:34:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:34:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-25 19:34:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 19:34:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:34:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-25 19:34:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-25 19:34:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:34:52,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:34:52,816 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:34:52,818 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:34:52,822 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 19:35:04,132 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:35:04,163 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:35:04,166 INFO L301 CfgBuilder]: Removed 160 assume(true) statements. [2021-11-25 19:35:04,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:35:04 BoogieIcfgContainer [2021-11-25 19:35:04,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:35:04,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:35:04,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:35:04,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:35:04,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:34:50" (1/3) ... [2021-11-25 19:35:04,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367fb32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:35:04, skipping insertion in model container [2021-11-25 19:35:04,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:34:51" (2/3) ... [2021-11-25 19:35:04,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367fb32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:35:04, skipping insertion in model container [2021-11-25 19:35:04,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:35:04" (3/3) ... [2021-11-25 19:35:04,188 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-2.i [2021-11-25 19:35:04,195 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:35:04,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1095 error locations. [2021-11-25 19:35:04,260 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:35:04,274 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 19:35:04,275 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1095 error locations. [2021-11-25 19:35:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 2259 states, 1152 states have (on average 2.2144097222222223) internal successors, (2551), 2245 states have internal predecessors, (2551), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-25 19:35:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-25 19:35:04,377 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:04,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-25 19:35:04,380 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2021-11-25 19:35:04,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:04,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910750508] [2021-11-25 19:35:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:04,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:04,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:04,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-25 19:35:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:04,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:35:04,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:04,828 INFO L388 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 [2021-11-25 19:35:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:04,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:04,856 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:04,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910750508] [2021-11-25 19:35:04,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910750508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:04,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:04,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:35:04,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275144737] [2021-11-25 19:35:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:04,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:04,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:04,914 INFO L87 Difference]: Start difference. First operand has 2259 states, 1152 states have (on average 2.2144097222222223) internal successors, (2551), 2245 states have internal predecessors, (2551), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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) [2021-11-25 19:35:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:10,390 INFO L93 Difference]: Finished difference Result 2934 states and 3120 transitions. [2021-11-25 19:35:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:10,392 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 [2021-11-25 19:35:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:10,432 INFO L225 Difference]: With dead ends: 2934 [2021-11-25 19:35:10,432 INFO L226 Difference]: Without dead ends: 2932 [2021-11-25 19:35:10,434 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:35:10,438 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 2142 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:10,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2152 Valid, 1869 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2021-11-25 19:35:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2021-11-25 19:35:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2401. [2021-11-25 19:35:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2401 states, 1318 states have (on average 2.0515933232169954) internal successors, (2704), 2385 states have internal predecessors, (2704), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-25 19:35:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2736 transitions. [2021-11-25 19:35:10,589 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2736 transitions. Word has length 3 [2021-11-25 19:35:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:10,590 INFO L470 AbstractCegarLoop]: Abstraction has 2401 states and 2736 transitions. [2021-11-25 19:35:10,590 INFO L471 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) [2021-11-25 19:35:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2736 transitions. [2021-11-25 19:35:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-25 19:35:10,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:10,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-25 19:35:10,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-25 19:35:10,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:10,805 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2021-11-25 19:35:10,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489961042] [2021-11-25 19:35:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:10,808 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:10,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:10,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:10,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-25 19:35:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:11,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:35:11,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:11,035 INFO L388 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 [2021-11-25 19:35:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:11,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:11,048 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:11,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489961042] [2021-11-25 19:35:11,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489961042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:11,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:11,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:35:11,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544989083] [2021-11-25 19:35:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:11,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:11,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:11,063 INFO L87 Difference]: Start difference. First operand 2401 states and 2736 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) [2021-11-25 19:35:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:17,670 INFO L93 Difference]: Finished difference Result 3371 states and 3798 transitions. [2021-11-25 19:35:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:17,672 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 [2021-11-25 19:35:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:17,694 INFO L225 Difference]: With dead ends: 3371 [2021-11-25 19:35:17,695 INFO L226 Difference]: Without dead ends: 3371 [2021-11-25 19:35:17,695 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:35:17,697 INFO L933 BasicCegarLoop]: 1951 mSDtfsCounter, 1054 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:17,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1058 Valid, 3245 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2021-11-25 19:35:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2021-11-25 19:35:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2850. [2021-11-25 19:35:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 1765 states have (on average 2.009631728045326) internal successors, (3547), 2831 states have internal predecessors, (3547), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-25 19:35:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 3585 transitions. [2021-11-25 19:35:17,796 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 3585 transitions. Word has length 3 [2021-11-25 19:35:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:17,796 INFO L470 AbstractCegarLoop]: Abstraction has 2850 states and 3585 transitions. [2021-11-25 19:35:17,797 INFO L471 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) [2021-11-25 19:35:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3585 transitions. [2021-11-25 19:35:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 19:35:17,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:17,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:17,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:18,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:18,012 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2021-11-25 19:35:18,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:18,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3525217] [2021-11-25 19:35:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:18,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:18,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:18,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-25 19:35:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:18,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:35:18,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:18,272 INFO L388 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 [2021-11-25 19:35:18,280 INFO L388 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 [2021-11-25 19:35:18,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:35:18,392 INFO L388 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 [2021-11-25 19:35:18,407 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:35:18,407 INFO L388 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 16 treesize of output 16 [2021-11-25 19:35:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:18,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:18,436 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:18,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3525217] [2021-11-25 19:35:18,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3525217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:18,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:18,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:35:18,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499221135] [2021-11-25 19:35:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:18,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:18,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:35:18,442 INFO L87 Difference]: Start difference. First operand 2850 states and 3585 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) [2021-11-25 19:35:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:32,286 INFO L93 Difference]: Finished difference Result 5481 states and 6388 transitions. [2021-11-25 19:35:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:35:32,288 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 [2021-11-25 19:35:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:32,323 INFO L225 Difference]: With dead ends: 5481 [2021-11-25 19:35:32,323 INFO L226 Difference]: Without dead ends: 5481 [2021-11-25 19:35:32,324 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:35:32,325 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 2765 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 4255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 4283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:32,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2775 Valid, 2890 Invalid, 4283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4255 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2021-11-25 19:35:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2021-11-25 19:35:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3569. [2021-11-25 19:35:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 2484 states have (on average 2.0426731078904994) internal successors, (5074), 3544 states have internal predecessors, (5074), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 5124 transitions. [2021-11-25 19:35:32,479 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 5124 transitions. Word has length 7 [2021-11-25 19:35:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:32,482 INFO L470 AbstractCegarLoop]: Abstraction has 3569 states and 5124 transitions. [2021-11-25 19:35:32,483 INFO L471 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) [2021-11-25 19:35:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 5124 transitions. [2021-11-25 19:35:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 19:35:32,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:32,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:32,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:32,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:32,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2021-11-25 19:35:32,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:32,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322702845] [2021-11-25 19:35:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:32,700 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:32,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:32,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:32,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-25 19:35:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:32,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:35:32,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:32,915 INFO L388 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 [2021-11-25 19:35:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:32,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:32,934 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322702845] [2021-11-25 19:35:32,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322702845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:32,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:32,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:35:32,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760012231] [2021-11-25 19:35:32,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:32,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:32,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:32,937 INFO L87 Difference]: Start difference. First operand 3569 states and 5124 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) [2021-11-25 19:35:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:37,221 INFO L93 Difference]: Finished difference Result 4773 states and 6641 transitions. [2021-11-25 19:35:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:37,222 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 [2021-11-25 19:35:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:37,252 INFO L225 Difference]: With dead ends: 4773 [2021-11-25 19:35:37,252 INFO L226 Difference]: Without dead ends: 4773 [2021-11-25 19:35:37,253 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:35:37,254 INFO L933 BasicCegarLoop]: 2177 mSDtfsCounter, 1998 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:37,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2008 Valid, 2933 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-11-25 19:35:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2021-11-25 19:35:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3478. [2021-11-25 19:35:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 2484 states have (on average 1.9569243156199678) internal successors, (4861), 3453 states have internal predecessors, (4861), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4911 transitions. [2021-11-25 19:35:37,371 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4911 transitions. Word has length 8 [2021-11-25 19:35:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:37,372 INFO L470 AbstractCegarLoop]: Abstraction has 3478 states and 4911 transitions. [2021-11-25 19:35:37,372 INFO L471 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) [2021-11-25 19:35:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4911 transitions. [2021-11-25 19:35:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 19:35:37,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:37,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:37,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:37,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:37,586 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2021-11-25 19:35:37,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:37,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511030892] [2021-11-25 19:35:37,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:37,588 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:37,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:37,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-25 19:35:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:37,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:35:37,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:37,803 INFO L388 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 [2021-11-25 19:35:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:37,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:37,835 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:37,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511030892] [2021-11-25 19:35:37,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511030892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:37,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:37,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:35:37,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835704924] [2021-11-25 19:35:37,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:37,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:37,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:37,838 INFO L87 Difference]: Start difference. First operand 3478 states and 4911 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) [2021-11-25 19:35:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:44,236 INFO L93 Difference]: Finished difference Result 5193 states and 7269 transitions. [2021-11-25 19:35:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:44,236 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 [2021-11-25 19:35:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:44,267 INFO L225 Difference]: With dead ends: 5193 [2021-11-25 19:35:44,268 INFO L226 Difference]: Without dead ends: 5193 [2021-11-25 19:35:44,268 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:35:44,269 INFO L933 BasicCegarLoop]: 2557 mSDtfsCounter, 1369 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:44,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1373 Valid, 3648 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2021-11-25 19:35:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2021-11-25 19:35:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 3800. [2021-11-25 19:35:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 2816 states have (on average 1.9435369318181819) internal successors, (5473), 3775 states have internal predecessors, (5473), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5523 transitions. [2021-11-25 19:35:44,413 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5523 transitions. Word has length 8 [2021-11-25 19:35:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:44,413 INFO L470 AbstractCegarLoop]: Abstraction has 3800 states and 5523 transitions. [2021-11-25 19:35:44,413 INFO L471 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) [2021-11-25 19:35:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5523 transitions. [2021-11-25 19:35:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 19:35:44,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:44,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:44,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:44,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:44,628 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2021-11-25 19:35:44,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:44,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795665497] [2021-11-25 19:35:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:44,630 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:44,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:44,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-25 19:35:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:44,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:35:44,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:44,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:44,895 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:44,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795665497] [2021-11-25 19:35:44,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795665497] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:44,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:44,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:35:44,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759045463] [2021-11-25 19:35:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:44,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:44,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:44,898 INFO L87 Difference]: Start difference. First operand 3800 states and 5523 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) [2021-11-25 19:35:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:44,955 INFO L93 Difference]: Finished difference Result 3740 states and 5437 transitions. [2021-11-25 19:35:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:44,956 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 [2021-11-25 19:35:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:44,985 INFO L225 Difference]: With dead ends: 3740 [2021-11-25 19:35:44,985 INFO L226 Difference]: Without dead ends: 3740 [2021-11-25 19:35:44,985 INFO L932 BasicCegarLoop]: 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 [2021-11-25 19:35:44,987 INFO L933 BasicCegarLoop]: 2221 mSDtfsCounter, 1011 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3437 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 [2021-11-25 19:35:44,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1015 Valid, 3437 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:35:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2021-11-25 19:35:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2021-11-25 19:35:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2780 states have (on average 1.9377697841726618) internal successors, (5387), 3715 states have internal predecessors, (5387), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5437 transitions. [2021-11-25 19:35:45,080 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5437 transitions. Word has length 11 [2021-11-25 19:35:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:45,080 INFO L470 AbstractCegarLoop]: Abstraction has 3740 states and 5437 transitions. [2021-11-25 19:35:45,081 INFO L471 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) [2021-11-25 19:35:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5437 transitions. [2021-11-25 19:35:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 19:35:45,081 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:45,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:45,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:45,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:45,301 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2021-11-25 19:35:45,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:45,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878146683] [2021-11-25 19:35:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:45,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:45,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:45,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-25 19:35:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:45,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:35:45,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:45,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:45,527 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:45,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878146683] [2021-11-25 19:35:45,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878146683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:45,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:45,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:35:45,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772428419] [2021-11-25 19:35:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:45,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:45,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:45,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:35:45,530 INFO L87 Difference]: Start difference. First operand 3740 states and 5437 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:35:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:45,646 INFO L93 Difference]: Finished difference Result 3712 states and 5381 transitions. [2021-11-25 19:35:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:35:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 19:35:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:45,660 INFO L225 Difference]: With dead ends: 3712 [2021-11-25 19:35:45,661 INFO L226 Difference]: Without dead ends: 3712 [2021-11-25 19:35:45,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:35:45,662 INFO L933 BasicCegarLoop]: 2176 mSDtfsCounter, 982 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 5561 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 [2021-11-25 19:35:45,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 5561 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:35:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2021-11-25 19:35:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3710. [2021-11-25 19:35:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 2764 states have (on average 1.9280028943560057) internal successors, (5329), 3685 states have internal predecessors, (5329), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5379 transitions. [2021-11-25 19:35:45,757 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5379 transitions. Word has length 13 [2021-11-25 19:35:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:45,757 INFO L470 AbstractCegarLoop]: Abstraction has 3710 states and 5379 transitions. [2021-11-25 19:35:45,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:35:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5379 transitions. [2021-11-25 19:35:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:35:45,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:45,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:45,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-25 19:35:45,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:45,972 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2021-11-25 19:35:45,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:45,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949169751] [2021-11-25 19:35:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:45,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:45,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:46,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-25 19:35:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:46,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:35:46,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:46,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:46,282 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:46,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949169751] [2021-11-25 19:35:46,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949169751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:46,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:46,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:35:46,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109849979] [2021-11-25 19:35:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:46,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:46,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:46,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:46,286 INFO L87 Difference]: Start difference. First operand 3710 states and 5379 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2021-11-25 19:35:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:46,355 INFO L93 Difference]: Finished difference Result 5158 states and 6946 transitions. [2021-11-25 19:35:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:46,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 [2021-11-25 19:35:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:46,370 INFO L225 Difference]: With dead ends: 5158 [2021-11-25 19:35:46,371 INFO L226 Difference]: Without dead ends: 5158 [2021-11-25 19:35:46,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:46,372 INFO L933 BasicCegarLoop]: 3496 mSDtfsCounter, 2102 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 5112 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 [2021-11-25 19:35:46,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2112 Valid, 5112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:35:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2021-11-25 19:35:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 3650. [2021-11-25 19:35:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2728 states have (on average 1.9219208211143695) internal successors, (5243), 3625 states have internal predecessors, (5243), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5293 transitions. [2021-11-25 19:35:46,491 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 5293 transitions. Word has length 20 [2021-11-25 19:35:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:46,492 INFO L470 AbstractCegarLoop]: Abstraction has 3650 states and 5293 transitions. [2021-11-25 19:35:46,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2021-11-25 19:35:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 5293 transitions. [2021-11-25 19:35:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:35:46,494 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:46,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:46,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:46,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:46,708 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2021-11-25 19:35:46,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:46,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297941290] [2021-11-25 19:35:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:46,710 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:46,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:46,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:46,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-25 19:35:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:46,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:35:46,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:47,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:47,016 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:47,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297941290] [2021-11-25 19:35:47,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297941290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:47,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:47,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:35:47,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830601370] [2021-11-25 19:35:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:47,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:35:47,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:35:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:47,018 INFO L87 Difference]: Start difference. First operand 3650 states and 5293 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2021-11-25 19:35:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:47,075 INFO L93 Difference]: Finished difference Result 4991 states and 6655 transitions. [2021-11-25 19:35:47,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:35:47,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 [2021-11-25 19:35:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:47,087 INFO L225 Difference]: With dead ends: 4991 [2021-11-25 19:35:47,088 INFO L226 Difference]: Without dead ends: 4991 [2021-11-25 19:35:47,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:35:47,089 INFO L933 BasicCegarLoop]: 3628 mSDtfsCounter, 2059 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 5196 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 [2021-11-25 19:35:47,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2069 Valid, 5196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:35:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2021-11-25 19:35:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 3518. [2021-11-25 19:35:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 2620 states have (on average 1.9026717557251909) internal successors, (4985), 3493 states have internal predecessors, (4985), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 5035 transitions. [2021-11-25 19:35:47,160 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 5035 transitions. Word has length 20 [2021-11-25 19:35:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:47,161 INFO L470 AbstractCegarLoop]: Abstraction has 3518 states and 5035 transitions. [2021-11-25 19:35:47,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2021-11-25 19:35:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 5035 transitions. [2021-11-25 19:35:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 19:35:47,162 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:47,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:47,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:47,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:47,379 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2021-11-25 19:35:47,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900312137] [2021-11-25 19:35:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:47,381 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:47,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:47,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-25 19:35:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:47,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:35:47,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:47,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:47,661 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900312137] [2021-11-25 19:35:47,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900312137] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:47,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:47,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:35:47,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977802329] [2021-11-25 19:35:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:47,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:47,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:35:47,663 INFO L87 Difference]: Start difference. First operand 3518 states and 5035 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-11-25 19:35:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:47,792 INFO L93 Difference]: Finished difference Result 4956 states and 6589 transitions. [2021-11-25 19:35:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:35:47,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2021-11-25 19:35:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:47,821 INFO L225 Difference]: With dead ends: 4956 [2021-11-25 19:35:47,822 INFO L226 Difference]: Without dead ends: 4956 [2021-11-25 19:35:47,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:35:47,824 INFO L933 BasicCegarLoop]: 3588 mSDtfsCounter, 2030 mSDsluCounter, 5154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 8742 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 [2021-11-25 19:35:47,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2040 Valid, 8742 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:35:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2021-11-25 19:35:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 3488. [2021-11-25 19:35:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 2604 states have (on average 1.892089093701997) internal successors, (4927), 3463 states have internal predecessors, (4927), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4977 transitions. [2021-11-25 19:35:47,909 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4977 transitions. Word has length 22 [2021-11-25 19:35:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:47,910 INFO L470 AbstractCegarLoop]: Abstraction has 3488 states and 4977 transitions. [2021-11-25 19:35:47,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-11-25 19:35:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4977 transitions. [2021-11-25 19:35:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 19:35:47,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:47,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:47,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:48,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:48,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2021-11-25 19:35:48,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:48,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672444316] [2021-11-25 19:35:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:48,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:48,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:48,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:48,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-25 19:35:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:48,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:35:48,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:48,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:48,523 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:48,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672444316] [2021-11-25 19:35:48,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672444316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:48,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:48,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:35:48,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318499099] [2021-11-25 19:35:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:48,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:48,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:35:48,527 INFO L87 Difference]: Start difference. First operand 3488 states and 4977 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-11-25 19:35:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:48,664 INFO L93 Difference]: Finished difference Result 4883 states and 6400 transitions. [2021-11-25 19:35:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:35:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2021-11-25 19:35:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:48,679 INFO L225 Difference]: With dead ends: 4883 [2021-11-25 19:35:48,679 INFO L226 Difference]: Without dead ends: 4883 [2021-11-25 19:35:48,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:35:48,681 INFO L933 BasicCegarLoop]: 3513 mSDtfsCounter, 1995 mSDsluCounter, 5039 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 8552 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 [2021-11-25 19:35:48,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2005 Valid, 8552 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:35:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2021-11-25 19:35:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3426. [2021-11-25 19:35:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 2556 states have (on average 1.859546165884194) internal successors, (4753), 3401 states have internal predecessors, (4753), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4803 transitions. [2021-11-25 19:35:48,755 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4803 transitions. Word has length 22 [2021-11-25 19:35:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:48,793 INFO L470 AbstractCegarLoop]: Abstraction has 3426 states and 4803 transitions. [2021-11-25 19:35:48,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-11-25 19:35:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4803 transitions. [2021-11-25 19:35:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:35:48,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:48,795 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:35:48,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:49,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:49,005 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2021-11-25 19:35:49,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860295951] [2021-11-25 19:35:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:49,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:49,007 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:49,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-25 19:35:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:49,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:35:49,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:49,276 INFO L388 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 [2021-11-25 19:35:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:49,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:49,394 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860295951] [2021-11-25 19:35:49,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860295951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:49,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:49,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:35:49,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363419825] [2021-11-25 19:35:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:49,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:49,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:35:49,396 INFO L87 Difference]: Start difference. First operand 3426 states and 4803 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:35:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:53,839 INFO L93 Difference]: Finished difference Result 3878 states and 5162 transitions. [2021-11-25 19:35:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:35:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:35:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:53,847 INFO L225 Difference]: With dead ends: 3878 [2021-11-25 19:35:53,848 INFO L226 Difference]: Without dead ends: 3878 [2021-11-25 19:35:53,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:35:53,849 INFO L933 BasicCegarLoop]: 1244 mSDtfsCounter, 2745 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2751 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:53,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2751 Valid, 2342 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-25 19:35:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2021-11-25 19:35:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3422. [2021-11-25 19:35:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2556 states have (on average 1.85641627543036) internal successors, (4745), 3397 states have internal predecessors, (4745), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:35:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4795 transitions. [2021-11-25 19:35:53,907 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4795 transitions. Word has length 27 [2021-11-25 19:35:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:53,907 INFO L470 AbstractCegarLoop]: Abstraction has 3422 states and 4795 transitions. [2021-11-25 19:35:53,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:35:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4795 transitions. [2021-11-25 19:35:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:35:53,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:53,908 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:35:53,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:54,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:35:54,121 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:35:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2021-11-25 19:35:54,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:35:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903986393] [2021-11-25 19:35:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:54,122 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:35:54,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:35:54,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:35:54,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-25 19:35:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:54,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:35:54,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:54,392 INFO L388 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 [2021-11-25 19:35:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:35:54,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:54,608 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:35:54,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903986393] [2021-11-25 19:35:54,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903986393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:54,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:54,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:35:54,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704997180] [2021-11-25 19:35:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:54,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:54,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:35:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:35:54,610 INFO L87 Difference]: Start difference. First operand 3422 states and 4795 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:36:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:01,568 INFO L93 Difference]: Finished difference Result 4323 states and 5779 transitions. [2021-11-25 19:36:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:36:01,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:36:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:01,578 INFO L225 Difference]: With dead ends: 4323 [2021-11-25 19:36:01,578 INFO L226 Difference]: Without dead ends: 4323 [2021-11-25 19:36:01,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:01,579 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 1907 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 3817 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:01,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1907 Valid, 3817 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2021-11-25 19:36:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2021-11-25 19:36:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 3458. [2021-11-25 19:36:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2592 states have (on average 1.8464506172839505) internal successors, (4786), 3433 states have internal predecessors, (4786), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:36:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4836 transitions. [2021-11-25 19:36:01,669 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4836 transitions. Word has length 27 [2021-11-25 19:36:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:01,669 INFO L470 AbstractCegarLoop]: Abstraction has 3458 states and 4836 transitions. [2021-11-25 19:36:01,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:36:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4836 transitions. [2021-11-25 19:36:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 19:36:01,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:01,674 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:01,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:01,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:01,886 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:01,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2021-11-25 19:36:01,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:01,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488538691] [2021-11-25 19:36:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:01,888 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:01,889 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:01,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-25 19:36:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:02,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:36:02,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:02,171 INFO L388 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 [2021-11-25 19:36:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:02,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:02,296 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:02,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488538691] [2021-11-25 19:36:02,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488538691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:02,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:02,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:02,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818120737] [2021-11-25 19:36:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:02,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:02,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:02,298 INFO L87 Difference]: Start difference. First operand 3458 states and 4836 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:09,153 INFO L93 Difference]: Finished difference Result 6686 states and 9193 transitions. [2021-11-25 19:36:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:36:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-11-25 19:36:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:09,164 INFO L225 Difference]: With dead ends: 6686 [2021-11-25 19:36:09,165 INFO L226 Difference]: Without dead ends: 6686 [2021-11-25 19:36:09,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:09,166 INFO L933 BasicCegarLoop]: 2703 mSDtfsCounter, 3693 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3700 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:09,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3700 Valid, 4839 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2021-11-25 19:36:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2021-11-25 19:36:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 3454. [2021-11-25 19:36:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2592 states have (on average 1.8433641975308641) internal successors, (4778), 3429 states have internal predecessors, (4778), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:36:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4828 transitions. [2021-11-25 19:36:09,249 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4828 transitions. Word has length 36 [2021-11-25 19:36:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:09,249 INFO L470 AbstractCegarLoop]: Abstraction has 3454 states and 4828 transitions. [2021-11-25 19:36:09,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4828 transitions. [2021-11-25 19:36:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 19:36:09,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:09,251 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:09,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-11-25 19:36:09,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:09,465 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2021-11-25 19:36:09,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82947593] [2021-11-25 19:36:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:09,466 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:09,468 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:09,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-25 19:36:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:09,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:36:09,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:09,795 INFO L388 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 [2021-11-25 19:36:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:10,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:10,045 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:10,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82947593] [2021-11-25 19:36:10,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82947593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:10,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:10,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:10,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225840355] [2021-11-25 19:36:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:10,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:10,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:10,047 INFO L87 Difference]: Start difference. First operand 3454 states and 4828 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:19,102 INFO L93 Difference]: Finished difference Result 6369 states and 8585 transitions. [2021-11-25 19:36:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:36:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-11-25 19:36:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:19,108 INFO L225 Difference]: With dead ends: 6369 [2021-11-25 19:36:19,108 INFO L226 Difference]: Without dead ends: 6369 [2021-11-25 19:36:19,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:19,109 INFO L933 BasicCegarLoop]: 2653 mSDtfsCounter, 3063 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 5267 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:19,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3067 Valid, 5267 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2021-11-25 19:36:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2021-11-25 19:36:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 3450. [2021-11-25 19:36:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2592 states have (on average 1.8402777777777777) internal successors, (4770), 3425 states have internal predecessors, (4770), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:36:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4820 transitions. [2021-11-25 19:36:19,172 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4820 transitions. Word has length 36 [2021-11-25 19:36:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:19,173 INFO L470 AbstractCegarLoop]: Abstraction has 3450 states and 4820 transitions. [2021-11-25 19:36:19,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4820 transitions. [2021-11-25 19:36:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 19:36:19,174 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:19,174 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:19,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-25 19:36:19,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:19,386 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2021-11-25 19:36:19,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:19,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298637649] [2021-11-25 19:36:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:19,388 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:19,389 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:19,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-25 19:36:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:19,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:36:19,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:19,640 INFO L388 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 [2021-11-25 19:36:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:19,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:19,790 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298637649] [2021-11-25 19:36:19,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298637649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:19,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:19,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:19,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084095071] [2021-11-25 19:36:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:19,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:19,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:19,793 INFO L87 Difference]: Start difference. First operand 3450 states and 4820 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:26,500 INFO L93 Difference]: Finished difference Result 7130 states and 9705 transitions. [2021-11-25 19:36:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:36:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-11-25 19:36:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:26,512 INFO L225 Difference]: With dead ends: 7130 [2021-11-25 19:36:26,512 INFO L226 Difference]: Without dead ends: 7130 [2021-11-25 19:36:26,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:26,513 INFO L933 BasicCegarLoop]: 2271 mSDtfsCounter, 4685 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:26,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4695 Valid, 4597 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2021-11-25 19:36:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2021-11-25 19:36:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 3447. [2021-11-25 19:36:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2592 states have (on average 1.8317901234567902) internal successors, (4748), 3422 states have internal predecessors, (4748), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:36:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4798 transitions. [2021-11-25 19:36:26,593 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4798 transitions. Word has length 36 [2021-11-25 19:36:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:26,593 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 4798 transitions. [2021-11-25 19:36:26,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4798 transitions. [2021-11-25 19:36:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 19:36:26,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:26,595 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:26,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:26,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:26,809 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2021-11-25 19:36:26,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:26,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111671731] [2021-11-25 19:36:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:26,810 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:26,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:26,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-25 19:36:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:27,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:36:27,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:27,163 INFO L388 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 [2021-11-25 19:36:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:27,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:27,450 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111671731] [2021-11-25 19:36:27,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111671731] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:27,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:27,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:27,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690939000] [2021-11-25 19:36:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:27,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:27,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:27,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:27,452 INFO L87 Difference]: Start difference. First operand 3447 states and 4798 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:35,840 INFO L93 Difference]: Finished difference Result 5205 states and 6971 transitions. [2021-11-25 19:36:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:36:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-11-25 19:36:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:35,844 INFO L225 Difference]: With dead ends: 5205 [2021-11-25 19:36:35,844 INFO L226 Difference]: Without dead ends: 5205 [2021-11-25 19:36:35,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:35,845 INFO L933 BasicCegarLoop]: 2560 mSDtfsCounter, 2416 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 4747 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:35,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2416 Valid, 4747 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2021-11-25 19:36:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2021-11-25 19:36:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 3447. [2021-11-25 19:36:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2592 states have (on average 1.8287037037037037) internal successors, (4740), 3422 states have internal predecessors, (4740), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:36:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4790 transitions. [2021-11-25 19:36:35,900 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4790 transitions. Word has length 36 [2021-11-25 19:36:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:35,901 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 4790 transitions. [2021-11-25 19:36:35,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2021-11-25 19:36:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4790 transitions. [2021-11-25 19:36:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 19:36:35,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:35,902 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:35,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:36,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:36,114 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:36,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2021-11-25 19:36:36,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:36,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106578848] [2021-11-25 19:36:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:36,116 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:36,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:36,117 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:36,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-25 19:36:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:36,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:36:36,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:36,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:36,481 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:36,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106578848] [2021-11-25 19:36:36,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106578848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:36,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:36,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:36:36,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963028909] [2021-11-25 19:36:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:36,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:36,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:36,483 INFO L87 Difference]: Start difference. First operand 3447 states and 4790 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2021-11-25 19:36:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:36,611 INFO L93 Difference]: Finished difference Result 3435 states and 4766 transitions. [2021-11-25 19:36:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:36:36,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2021-11-25 19:36:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:36,617 INFO L225 Difference]: With dead ends: 3435 [2021-11-25 19:36:36,617 INFO L226 Difference]: Without dead ends: 3435 [2021-11-25 19:36:36,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:36,618 INFO L933 BasicCegarLoop]: 2007 mSDtfsCounter, 966 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 5042 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.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:36,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 5042 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:36:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2021-11-25 19:36:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2021-11-25 19:36:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2580 states have (on average 1.827906976744186) internal successors, (4716), 3410 states have internal predecessors, (4716), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 19:36:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4766 transitions. [2021-11-25 19:36:36,684 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4766 transitions. Word has length 40 [2021-11-25 19:36:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:36,684 INFO L470 AbstractCegarLoop]: Abstraction has 3435 states and 4766 transitions. [2021-11-25 19:36:36,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2021-11-25 19:36:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4766 transitions. [2021-11-25 19:36:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-25 19:36:36,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:36,686 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:36,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:36,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:36,906 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2021-11-25 19:36:36,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:36,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077849187] [2021-11-25 19:36:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:36,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:36,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:36,908 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:36,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-25 19:36:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:37,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:36:37,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:37,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:37,511 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077849187] [2021-11-25 19:36:37,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077849187] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:37,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:37,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:37,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857539925] [2021-11-25 19:36:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:37,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:36:37,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:36:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:36:37,513 INFO L87 Difference]: Start difference. First operand 3435 states and 4766 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2021-11-25 19:36:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:37,920 INFO L93 Difference]: Finished difference Result 5077 states and 6789 transitions. [2021-11-25 19:36:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:36:37,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2021-11-25 19:36:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:37,926 INFO L225 Difference]: With dead ends: 5077 [2021-11-25 19:36:37,926 INFO L226 Difference]: Without dead ends: 5077 [2021-11-25 19:36:37,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:36:37,927 INFO L933 BasicCegarLoop]: 2098 mSDtfsCounter, 1382 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:37,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1391 Valid, 3952 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 19:36:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2021-11-25 19:36:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4452. [2021-11-25 19:36:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 3590 states have (on average 1.8147632311977715) internal successors, (6515), 4417 states have internal predecessors, (6515), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-25 19:36:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6585 transitions. [2021-11-25 19:36:38,036 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6585 transitions. Word has length 48 [2021-11-25 19:36:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:38,036 INFO L470 AbstractCegarLoop]: Abstraction has 4452 states and 6585 transitions. [2021-11-25 19:36:38,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2021-11-25 19:36:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6585 transitions. [2021-11-25 19:36:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-25 19:36:38,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:38,038 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:38,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:38,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:38,258 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2021-11-25 19:36:38,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:38,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239518854] [2021-11-25 19:36:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:38,260 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:38,261 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:38,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-25 19:36:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:38,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:36:38,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:38,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:38,648 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239518854] [2021-11-25 19:36:38,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239518854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:38,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:38,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:36:38,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306104971] [2021-11-25 19:36:38,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:38,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:38,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:38,651 INFO L87 Difference]: Start difference. First operand 4452 states and 6585 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2021-11-25 19:36:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:38,740 INFO L93 Difference]: Finished difference Result 5586 states and 7773 transitions. [2021-11-25 19:36:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:36:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2021-11-25 19:36:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:38,749 INFO L225 Difference]: With dead ends: 5586 [2021-11-25 19:36:38,749 INFO L226 Difference]: Without dead ends: 5586 [2021-11-25 19:36:38,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:38,750 INFO L933 BasicCegarLoop]: 3060 mSDtfsCounter, 1965 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 7417 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 [2021-11-25 19:36:38,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1975 Valid, 7417 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:36:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2021-11-25 19:36:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 4410. [2021-11-25 19:36:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 3548 states have (on average 1.8165163472378805) internal successors, (6445), 4375 states have internal predecessors, (6445), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-25 19:36:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 6515 transitions. [2021-11-25 19:36:38,853 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 6515 transitions. Word has length 51 [2021-11-25 19:36:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:38,854 INFO L470 AbstractCegarLoop]: Abstraction has 4410 states and 6515 transitions. [2021-11-25 19:36:38,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2021-11-25 19:36:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 6515 transitions. [2021-11-25 19:36:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-25 19:36:38,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:38,855 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:38,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:39,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:39,069 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2021-11-25 19:36:39,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:39,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093409002] [2021-11-25 19:36:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:39,071 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:39,073 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:39,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-25 19:36:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:39,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:36:39,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:39,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:39,647 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:39,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093409002] [2021-11-25 19:36:39,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093409002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:39,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:39,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:36:39,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864719454] [2021-11-25 19:36:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:39,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:39,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:39,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:39,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:39,650 INFO L87 Difference]: Start difference. First operand 4410 states and 6515 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:36:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:39,755 INFO L93 Difference]: Finished difference Result 5322 states and 7259 transitions. [2021-11-25 19:36:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:36:39,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-25 19:36:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:39,763 INFO L225 Difference]: With dead ends: 5322 [2021-11-25 19:36:39,764 INFO L226 Difference]: Without dead ends: 5322 [2021-11-25 19:36:39,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:39,767 INFO L933 BasicCegarLoop]: 3322 mSDtfsCounter, 1956 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 7990 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.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:39,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1966 Valid, 7990 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:36:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2021-11-25 19:36:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4392. [2021-11-25 19:36:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 3530 states have (on average 1.8172804532577904) internal successors, (6415), 4357 states have internal predecessors, (6415), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-25 19:36:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6485 transitions. [2021-11-25 19:36:39,902 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6485 transitions. Word has length 54 [2021-11-25 19:36:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:39,904 INFO L470 AbstractCegarLoop]: Abstraction has 4392 states and 6485 transitions. [2021-11-25 19:36:39,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:36:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6485 transitions. [2021-11-25 19:36:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-25 19:36:39,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:39,905 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:39,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-11-25 19:36:40,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:40,123 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -665468730, now seen corresponding path program 1 times [2021-11-25 19:36:40,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145734311] [2021-11-25 19:36:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:40,124 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:40,126 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:40,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-25 19:36:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:40,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:36:40,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:40,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:36:40,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:36:40,647 INFO L354 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2021-11-25 19:36:40,647 INFO L388 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 3 case distinctions, treesize of input 29 treesize of output 36 [2021-11-25 19:36:40,727 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-25 19:36:40,727 INFO L388 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 60 treesize of output 20 [2021-11-25 19:36:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:40,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:40,872 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:40,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145734311] [2021-11-25 19:36:40,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145734311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:40,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:40,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:36:40,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894541988] [2021-11-25 19:36:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:40,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:40,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:40,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:40,875 INFO L87 Difference]: Start difference. First operand 4392 states and 6485 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:36:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:42,981 INFO L93 Difference]: Finished difference Result 4496 states and 6595 transitions. [2021-11-25 19:36:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:36:42,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-25 19:36:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:42,988 INFO L225 Difference]: With dead ends: 4496 [2021-11-25 19:36:42,988 INFO L226 Difference]: Without dead ends: 4496 [2021-11-25 19:36:42,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:42,989 INFO L933 BasicCegarLoop]: 1895 mSDtfsCounter, 907 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:42,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [911 Valid, 4846 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 122 Unchecked, 2.0s Time] [2021-11-25 19:36:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2021-11-25 19:36:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4358. [2021-11-25 19:36:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4358 states, 3496 states have (on average 1.8249427917620138) internal successors, (6380), 4323 states have internal predecessors, (6380), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-25 19:36:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4358 states to 4358 states and 6450 transitions. [2021-11-25 19:36:43,049 INFO L78 Accepts]: Start accepts. Automaton has 4358 states and 6450 transitions. Word has length 57 [2021-11-25 19:36:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:43,049 INFO L470 AbstractCegarLoop]: Abstraction has 4358 states and 6450 transitions. [2021-11-25 19:36:43,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:36:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4358 states and 6450 transitions. [2021-11-25 19:36:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-25 19:36:43,050 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:43,050 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:43,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:43,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:43,263 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2021-11-25 19:36:43,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:43,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108965503] [2021-11-25 19:36:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:43,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:43,266 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:43,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-25 19:36:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:43,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:36:43,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:44,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:44,006 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:44,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108965503] [2021-11-25 19:36:44,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108965503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:44,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:44,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:44,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318843026] [2021-11-25 19:36:44,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:44,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:36:44,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:44,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:36:44,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:36:44,008 INFO L87 Difference]: Start difference. First operand 4358 states and 6450 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2021-11-25 19:36:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:44,195 INFO L93 Difference]: Finished difference Result 5982 states and 8540 transitions. [2021-11-25 19:36:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:36:44,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2021-11-25 19:36:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:44,203 INFO L225 Difference]: With dead ends: 5982 [2021-11-25 19:36:44,203 INFO L226 Difference]: Without dead ends: 5982 [2021-11-25 19:36:44,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:36:44,204 INFO L933 BasicCegarLoop]: 2433 mSDtfsCounter, 1079 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:44,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 4315 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:36:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2021-11-25 19:36:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 5431. [2021-11-25 19:36:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 4561 states have (on average 1.8013593510195132) internal successors, (8216), 5385 states have internal predecessors, (8216), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-25 19:36:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 8308 transitions. [2021-11-25 19:36:44,290 INFO L78 Accepts]: Start accepts. Automaton has 5431 states and 8308 transitions. Word has length 59 [2021-11-25 19:36:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:44,290 INFO L470 AbstractCegarLoop]: Abstraction has 5431 states and 8308 transitions. [2021-11-25 19:36:44,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2021-11-25 19:36:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5431 states and 8308 transitions. [2021-11-25 19:36:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-25 19:36:44,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:44,292 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:44,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:44,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:44,533 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2021-11-25 19:36:44,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:44,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637887104] [2021-11-25 19:36:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:44,534 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:44,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:44,536 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:44,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-25 19:36:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:45,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:36:45,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:45,028 INFO L388 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 [2021-11-25 19:36:45,038 INFO L388 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 [2021-11-25 19:36:45,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:36:45,667 INFO L388 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 [2021-11-25 19:36:45,684 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:36:45,684 INFO L388 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 17 treesize of output 17 [2021-11-25 19:36:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:45,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:45,702 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:45,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637887104] [2021-11-25 19:36:45,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637887104] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:45,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:45,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:36:45,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882727301] [2021-11-25 19:36:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:45,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:36:45,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:36:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:45,703 INFO L87 Difference]: Start difference. First operand 5431 states and 8308 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2021-11-25 19:36:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:50,877 INFO L93 Difference]: Finished difference Result 7850 states and 12031 transitions. [2021-11-25 19:36:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:36:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2021-11-25 19:36:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:50,885 INFO L225 Difference]: With dead ends: 7850 [2021-11-25 19:36:50,885 INFO L226 Difference]: Without dead ends: 7850 [2021-11-25 19:36:50,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:36:50,886 INFO L933 BasicCegarLoop]: 853 mSDtfsCounter, 4067 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:50,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4081 Valid, 1363 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-11-25 19:36:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2021-11-25 19:36:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 5191. [2021-11-25 19:36:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4405 states have (on average 1.7332576617480135) internal successors, (7635), 5145 states have internal predecessors, (7635), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-25 19:36:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7727 transitions. [2021-11-25 19:36:50,964 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7727 transitions. Word has length 62 [2021-11-25 19:36:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:50,965 INFO L470 AbstractCegarLoop]: Abstraction has 5191 states and 7727 transitions. [2021-11-25 19:36:50,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2021-11-25 19:36:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7727 transitions. [2021-11-25 19:36:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 19:36:50,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:50,966 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:50,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:51,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:51,172 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2021-11-25 19:36:51,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:51,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050255753] [2021-11-25 19:36:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:51,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:51,174 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:51,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-25 19:36:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:51,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:36:51,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:51,727 INFO L388 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 [2021-11-25 19:36:51,742 INFO L388 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 [2021-11-25 19:36:51,773 INFO L388 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 25 treesize of output 13 [2021-11-25 19:36:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:51,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:51,783 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:51,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050255753] [2021-11-25 19:36:51,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050255753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:51,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:51,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:36:51,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841764719] [2021-11-25 19:36:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:51,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:36:51,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:36:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:51,787 INFO L87 Difference]: Start difference. First operand 5191 states and 7727 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:36:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:36:56,812 INFO L93 Difference]: Finished difference Result 5190 states and 7724 transitions. [2021-11-25 19:36:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:36:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2021-11-25 19:36:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:36:56,818 INFO L225 Difference]: With dead ends: 5190 [2021-11-25 19:36:56,818 INFO L226 Difference]: Without dead ends: 5190 [2021-11-25 19:36:56,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:36:56,818 INFO L933 BasicCegarLoop]: 1926 mSDtfsCounter, 4 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:36:56,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5114 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-25 19:36:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2021-11-25 19:36:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2021-11-25 19:36:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4405 states have (on average 1.7325766174801362) internal successors, (7632), 5144 states have internal predecessors, (7632), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-25 19:36:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7724 transitions. [2021-11-25 19:36:56,895 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7724 transitions. Word has length 67 [2021-11-25 19:36:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:36:56,895 INFO L470 AbstractCegarLoop]: Abstraction has 5190 states and 7724 transitions. [2021-11-25 19:36:56,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:36:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7724 transitions. [2021-11-25 19:36:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 19:36:56,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:36:56,903 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:36:56,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-25 19:36:57,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:36:57,121 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:36:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:36:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2021-11-25 19:36:57,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:36:57,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872104902] [2021-11-25 19:36:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:36:57,123 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:36:57,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:36:57,124 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:36:57,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-25 19:36:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:36:57,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:36:57,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:36:57,574 INFO L388 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 [2021-11-25 19:36:57,610 INFO L388 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 [2021-11-25 19:36:57,619 INFO L388 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 [2021-11-25 19:36:57,675 INFO L388 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 [2021-11-25 19:36:57,678 INFO L388 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 [2021-11-25 19:36:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:36:57,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:36:57,694 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:36:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872104902] [2021-11-25 19:36:57,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872104902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:36:57,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:36:57,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:36:57,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810643742] [2021-11-25 19:36:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:36:57,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:36:57,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:36:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:36:57,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:36:57,696 INFO L87 Difference]: Start difference. First operand 5190 states and 7724 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:37:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:37:04,486 INFO L93 Difference]: Finished difference Result 5189 states and 7721 transitions. [2021-11-25 19:37:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:37:04,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2021-11-25 19:37:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:37:04,493 INFO L225 Difference]: With dead ends: 5189 [2021-11-25 19:37:04,493 INFO L226 Difference]: Without dead ends: 5189 [2021-11-25 19:37:04,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:37:04,493 INFO L933 BasicCegarLoop]: 1926 mSDtfsCounter, 2 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:37:04,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5103 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2021-11-25 19:37:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2021-11-25 19:37:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5189. [2021-11-25 19:37:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 4402 states have (on average 1.7330758746024535) internal successors, (7629), 5143 states have internal predecessors, (7629), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-25 19:37:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 7721 transitions. [2021-11-25 19:37:04,561 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 7721 transitions. Word has length 67 [2021-11-25 19:37:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:37:04,562 INFO L470 AbstractCegarLoop]: Abstraction has 5189 states and 7721 transitions. [2021-11-25 19:37:04,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:37:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 7721 transitions. [2021-11-25 19:37:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 19:37:04,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:37:04,564 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:37:04,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-11-25 19:37:04,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:37:04,776 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:37:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:37:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2021-11-25 19:37:04,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:37:04,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463856475] [2021-11-25 19:37:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:37:04,777 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:37:04,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:37:04,778 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:37:04,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-25 19:37:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:37:05,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:37:05,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:05,269 INFO L388 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 [2021-11-25 19:37:05,286 INFO L388 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 [2021-11-25 19:37:05,316 INFO L388 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 25 treesize of output 13 [2021-11-25 19:37:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:05,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:37:05,326 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:37:05,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463856475] [2021-11-25 19:37:05,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463856475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:37:05,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:37:05,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:37:05,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751135347] [2021-11-25 19:37:05,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:37:05,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:37:05,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:37:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:37:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:37:05,328 INFO L87 Difference]: Start difference. First operand 5189 states and 7721 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:37:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:37:10,282 INFO L93 Difference]: Finished difference Result 5188 states and 7717 transitions. [2021-11-25 19:37:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:37:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2021-11-25 19:37:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:37:10,287 INFO L225 Difference]: With dead ends: 5188 [2021-11-25 19:37:10,287 INFO L226 Difference]: Without dead ends: 5188 [2021-11-25 19:37:10,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:37:10,288 INFO L933 BasicCegarLoop]: 1924 mSDtfsCounter, 4 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5109 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:37:10,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5109 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-25 19:37:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2021-11-25 19:37:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 5188. [2021-11-25 19:37:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 4402 states have (on average 1.7321671967287597) internal successors, (7625), 5142 states have internal predecessors, (7625), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-25 19:37:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7717 transitions. [2021-11-25 19:37:10,346 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7717 transitions. Word has length 67 [2021-11-25 19:37:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:37:10,347 INFO L470 AbstractCegarLoop]: Abstraction has 5188 states and 7717 transitions. [2021-11-25 19:37:10,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:37:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7717 transitions. [2021-11-25 19:37:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 19:37:10,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:37:10,348 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:37:10,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-11-25 19:37:10,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:37:10,562 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:37:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:37:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2021-11-25 19:37:10,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:37:10,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712205221] [2021-11-25 19:37:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:37:10,563 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:37:10,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:37:10,575 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:37:10,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-25 19:37:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:37:10,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:37:10,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:10,996 INFO L388 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 [2021-11-25 19:37:11,015 INFO L388 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 [2021-11-25 19:37:11,024 INFO L388 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 [2021-11-25 19:37:11,075 INFO L388 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 [2021-11-25 19:37:11,079 INFO L388 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 [2021-11-25 19:37:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:11,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:37:11,095 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:37:11,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712205221] [2021-11-25 19:37:11,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712205221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:37:11,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:37:11,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:37:11,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676781635] [2021-11-25 19:37:11,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:37:11,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:37:11,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:37:11,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:37:11,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:37:11,097 INFO L87 Difference]: Start difference. First operand 5188 states and 7717 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:37:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:37:17,660 INFO L93 Difference]: Finished difference Result 5187 states and 7713 transitions. [2021-11-25 19:37:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:37:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2021-11-25 19:37:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:37:17,667 INFO L225 Difference]: With dead ends: 5187 [2021-11-25 19:37:17,667 INFO L226 Difference]: Without dead ends: 5187 [2021-11-25 19:37:17,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:37:17,668 INFO L933 BasicCegarLoop]: 1924 mSDtfsCounter, 2 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:37:17,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5098 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2021-11-25 19:37:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2021-11-25 19:37:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5187. [2021-11-25 19:37:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 4398 states have (on average 1.7328331059572533) internal successors, (7621), 5141 states have internal predecessors, (7621), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-25 19:37:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7713 transitions. [2021-11-25 19:37:17,732 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7713 transitions. Word has length 67 [2021-11-25 19:37:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:37:17,733 INFO L470 AbstractCegarLoop]: Abstraction has 5187 states and 7713 transitions. [2021-11-25 19:37:17,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-25 19:37:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7713 transitions. [2021-11-25 19:37:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-25 19:37:17,734 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:37:17,735 INFO L514 BasicCegarLoop]: 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, 1] [2021-11-25 19:37:17,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-11-25 19:37:17,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:37:17,951 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:37:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:37:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1448028751, now seen corresponding path program 1 times [2021-11-25 19:37:17,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:37:17,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051428593] [2021-11-25 19:37:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:37:17,953 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:37:17,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:37:17,953 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:37:17,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-25 19:37:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:37:18,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:37:18,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:18,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:37:18,492 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:37:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051428593] [2021-11-25 19:37:18,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051428593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:37:18,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:37:18,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:37:18,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64562139] [2021-11-25 19:37:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:37:18,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:37:18,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:37:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:37:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:37:18,497 INFO L87 Difference]: Start difference. First operand 5187 states and 7713 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2021-11-25 19:37:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:37:18,597 INFO L93 Difference]: Finished difference Result 5190 states and 7722 transitions. [2021-11-25 19:37:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:37:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2021-11-25 19:37:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:37:18,627 INFO L225 Difference]: With dead ends: 5190 [2021-11-25 19:37:18,637 INFO L226 Difference]: Without dead ends: 5190 [2021-11-25 19:37:18,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:37:18,638 INFO L933 BasicCegarLoop]: 1923 mSDtfsCounter, 2 mSDsluCounter, 3838 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5761 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:37:18,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5761 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:37:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2021-11-25 19:37:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2021-11-25 19:37:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4400 states have (on average 1.7327272727272727) internal successors, (7624), 5144 states have internal predecessors, (7624), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-11-25 19:37:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7722 transitions. [2021-11-25 19:37:18,712 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7722 transitions. Word has length 75 [2021-11-25 19:37:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:37:18,713 INFO L470 AbstractCegarLoop]: Abstraction has 5190 states and 7722 transitions. [2021-11-25 19:37:18,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2021-11-25 19:37:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7722 transitions. [2021-11-25 19:37:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-25 19:37:18,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:37:18,714 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-11-25 19:37:18,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-11-25 19:37:18,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:37:18,919 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:37:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:37:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1074294312, now seen corresponding path program 1 times [2021-11-25 19:37:18,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:37:18,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778281717] [2021-11-25 19:37:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:37:18,921 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:37:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:37:18,921 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:37:18,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-25 19:37:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:37:19,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:37:19,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:19,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:37:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:19,593 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:37:19,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778281717] [2021-11-25 19:37:19,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778281717] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:37:19,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1287282031] [2021-11-25 19:37:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:37:19,594 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:37:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:37:19,600 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:37:19,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-11-25 19:37:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:37:20,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:37:20,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:20,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:37:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:20,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1287282031] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:37:20,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589679854] [2021-11-25 19:37:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:37:20,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:37:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:37:20,642 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:37:20,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-25 19:37:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:37:20,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:37:20,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:21,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:37:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:21,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589679854] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:37:21,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:37:21,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2021-11-25 19:37:21,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339990255] [2021-11-25 19:37:21,212 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:37:21,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:37:21,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:37:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:37:21,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:37:21,214 INFO L87 Difference]: Start difference. First operand 5190 states and 7722 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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) [2021-11-25 19:37:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:37:21,456 INFO L93 Difference]: Finished difference Result 5202 states and 7744 transitions. [2021-11-25 19:37:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 19:37:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2021-11-25 19:37:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:37:21,470 INFO L225 Difference]: With dead ends: 5202 [2021-11-25 19:37:21,470 INFO L226 Difference]: Without dead ends: 5202 [2021-11-25 19:37:21,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:37:21,471 INFO L933 BasicCegarLoop]: 1923 mSDtfsCounter, 16 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7677 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:37:21,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 7677 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:37:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2021-11-25 19:37:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5200. [2021-11-25 19:37:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4409 states have (on average 1.732592424586074) internal successors, (7639), 5153 states have internal predecessors, (7639), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-11-25 19:37:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7737 transitions. [2021-11-25 19:37:21,587 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7737 transitions. Word has length 76 [2021-11-25 19:37:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:37:21,587 INFO L470 AbstractCegarLoop]: Abstraction has 5200 states and 7737 transitions. [2021-11-25 19:37:21,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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) [2021-11-25 19:37:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7737 transitions. [2021-11-25 19:37:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-25 19:37:21,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:37:21,589 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-11-25 19:37:21,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-11-25 19:37:21,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-11-25 19:37:22,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-25 19:37:22,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:37:22,196 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:37:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:37:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522737, now seen corresponding path program 2 times [2021-11-25 19:37:22,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:37:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873216084] [2021-11-25 19:37:22,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:37:22,198 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:37:22,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:37:22,199 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:37:22,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-11-25 19:37:22,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:37:22,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:37:22,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:37:22,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:22,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:37:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:23,288 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:37:23,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873216084] [2021-11-25 19:37:23,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873216084] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:37:23,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [585738672] [2021-11-25 19:37:23,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:37:23,289 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:37:23,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:37:23,290 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:37:23,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-11-25 19:37:25,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:37:25,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:37:25,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:37:25,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:37:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:25,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:37:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:37:25,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [585738672] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:37:25,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028578181] [2021-11-25 19:37:25,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:37:25,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:37:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:37:25,479 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:37:25,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 19:38:14,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:38:14,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:38:14,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 19:38:14,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:14,811 INFO L388 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 [2021-11-25 19:38:15,039 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:38:15,039 INFO L388 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 17 treesize of output 17 [2021-11-25 19:38:15,081 INFO L388 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 [2021-11-25 19:38:15,506 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:38:15,507 INFO L388 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 37 treesize of output 38 [2021-11-25 19:38:15,571 INFO L388 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 35 treesize of output 17 [2021-11-25 19:38:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:38:15,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:15,744 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-11-25 19:38:15,744 INFO L388 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 31 treesize of output 30 [2021-11-25 19:38:15,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2340) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2021-11-25 19:38:15,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028578181] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:38:15,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 19:38:15,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2021-11-25 19:38:15,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470865952] [2021-11-25 19:38:15,756 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 19:38:15,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:38:15,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:38:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:38:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=467, Unknown=2, NotChecked=44, Total=600 [2021-11-25 19:38:15,758 INFO L87 Difference]: Start difference. First operand 5200 states and 7737 transitions. Second operand has 23 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 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) [2021-11-25 19:38:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:38:39,718 INFO L93 Difference]: Finished difference Result 7852 states and 11975 transitions. [2021-11-25 19:38:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:38:39,718 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 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 79 [2021-11-25 19:38:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:38:39,738 INFO L225 Difference]: With dead ends: 7852 [2021-11-25 19:38:39,738 INFO L226 Difference]: Without dead ends: 7852 [2021-11-25 19:38:39,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=1743, Unknown=26, NotChecked=88, Total=2162 [2021-11-25 19:38:39,740 INFO L933 BasicCegarLoop]: 1254 mSDtfsCounter, 1607 mSDsluCounter, 21878 mSDsCounter, 0 mSdLazyCounter, 15179 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 23132 SdHoareTripleChecker+Invalid, 16210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 15179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 968 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:38:39,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1617 Valid, 23132 Invalid, 16210 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 15179 Invalid, 0 Unknown, 968 Unchecked, 22.8s Time] [2021-11-25 19:38:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states. [2021-11-25 19:38:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 5206. [2021-11-25 19:38:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4415 states have (on average 1.7320498301245753) internal successors, (7647), 5159 states have internal predecessors, (7647), 46 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (56), 43 states have call predecessors, (56), 46 states have call successors, (56) [2021-11-25 19:38:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 7749 transitions. [2021-11-25 19:38:39,892 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 7749 transitions. Word has length 79 [2021-11-25 19:38:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:38:39,893 INFO L470 AbstractCegarLoop]: Abstraction has 5206 states and 7749 transitions. [2021-11-25 19:38:39,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 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) [2021-11-25 19:38:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 7749 transitions. [2021-11-25 19:38:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-25 19:38:39,894 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:38:39,895 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-11-25 19:38:39,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:40,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2021-11-25 19:38:40,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:40,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:38:40,509 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:38:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:38:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1072291653, now seen corresponding path program 1 times [2021-11-25 19:38:40,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:38:40,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665606897] [2021-11-25 19:38:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:38:40,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:38:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:38:40,511 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:38:40,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-11-25 19:38:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:38:40,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:38:40,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:41,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:41,511 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:38:41,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665606897] [2021-11-25 19:38:41,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665606897] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:41,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433638666] [2021-11-25 19:38:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:38:41,512 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:38:41,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:38:41,513 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:38:41,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-11-25 19:38:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:38:42,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:38:42,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:42,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:42,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [433638666] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949929231] [2021-11-25 19:38:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:38:42,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:38:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:38:42,537 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:38:42,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-25 19:38:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:38:42,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:38:42,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:43,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:43,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949929231] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:43,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:38:43,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2021-11-25 19:38:43,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639921743] [2021-11-25 19:38:43,411 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:38:43,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:38:43,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:38:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:38:43,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:38:43,412 INFO L87 Difference]: Start difference. First operand 5206 states and 7749 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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) [2021-11-25 19:38:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:38:44,360 INFO L93 Difference]: Finished difference Result 5222 states and 7777 transitions. [2021-11-25 19:38:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:38:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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 79 [2021-11-25 19:38:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:38:44,373 INFO L225 Difference]: With dead ends: 5222 [2021-11-25 19:38:44,373 INFO L226 Difference]: Without dead ends: 5214 [2021-11-25 19:38:44,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=416, Invalid=774, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 19:38:44,375 INFO L933 BasicCegarLoop]: 1923 mSDtfsCounter, 96 mSDsluCounter, 9600 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 11523 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:38:44,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 11523 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 19:38:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2021-11-25 19:38:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 5208. [2021-11-25 19:38:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 4418 states have (on average 1.7308736985061113) internal successors, (7647), 5161 states have internal predecessors, (7647), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-11-25 19:38:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 7745 transitions. [2021-11-25 19:38:44,493 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 7745 transitions. Word has length 79 [2021-11-25 19:38:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:38:44,493 INFO L470 AbstractCegarLoop]: Abstraction has 5208 states and 7745 transitions. [2021-11-25 19:38:44,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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) [2021-11-25 19:38:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 7745 transitions. [2021-11-25 19:38:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-25 19:38:44,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:38:44,495 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:38:44,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:44,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:44,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:45,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:38:45,102 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:38:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:38:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash 873906672, now seen corresponding path program 1 times [2021-11-25 19:38:45,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:38:45,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442702363] [2021-11-25 19:38:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:38:45,104 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:38:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:38:45,106 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:38:45,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-11-25 19:38:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:38:45,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:38:45,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:45,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:46,482 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:38:46,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442702363] [2021-11-25 19:38:46,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442702363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:46,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551107934] [2021-11-25 19:38:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:38:46,483 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:38:46,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:38:46,484 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:38:46,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2021-11-25 19:38:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:38:47,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:38:47,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:47,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:47,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [551107934] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263640051] [2021-11-25 19:38:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:38:47,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:38:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:38:47,769 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:38:47,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-25 19:38:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:38:48,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 19:38:48,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:48,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:49,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263640051] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:49,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:38:49,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2021-11-25 19:38:49,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275388860] [2021-11-25 19:38:49,256 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:38:49,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 19:38:49,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:38:49,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 19:38:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:38:49,258 INFO L87 Difference]: Start difference. First operand 5208 states and 7745 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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) [2021-11-25 19:38:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:38:53,480 INFO L93 Difference]: Finished difference Result 5248 states and 7840 transitions. [2021-11-25 19:38:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-25 19:38:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 85 [2021-11-25 19:38:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:38:53,495 INFO L225 Difference]: With dead ends: 5248 [2021-11-25 19:38:53,495 INFO L226 Difference]: Without dead ends: 5242 [2021-11-25 19:38:53,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1590, Invalid=3240, Unknown=0, NotChecked=0, Total=4830 [2021-11-25 19:38:53,498 INFO L933 BasicCegarLoop]: 1928 mSDtfsCounter, 207 mSDsluCounter, 26900 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 28828 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:38:53,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 28828 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:38:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-11-25 19:38:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5226. [2021-11-25 19:38:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 4436 states have (on average 1.7290351668169521) internal successors, (7670), 5179 states have internal predecessors, (7670), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-11-25 19:38:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7768 transitions. [2021-11-25 19:38:53,573 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7768 transitions. Word has length 85 [2021-11-25 19:38:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:38:53,573 INFO L470 AbstractCegarLoop]: Abstraction has 5226 states and 7768 transitions. [2021-11-25 19:38:53,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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) [2021-11-25 19:38:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7768 transitions. [2021-11-25 19:38:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-25 19:38:53,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:38:53,575 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:38:53,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:53,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:54,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2021-11-25 19:38:54,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 19:38:54,197 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:38:54,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:38:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash -575079248, now seen corresponding path program 2 times [2021-11-25 19:38:54,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:38:54,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563607845] [2021-11-25 19:38:54,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:38:54,199 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:38:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:38:54,200 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:38:54,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2021-11-25 19:38:54,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:38:54,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:38:54,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 19:38:54,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:38:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:55,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:38:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:38:57,869 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:38:57,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563607845] [2021-11-25 19:38:57,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563607845] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:38:57,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433910879] [2021-11-25 19:38:57,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:38:57,870 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:38:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:38:57,870 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:38:57,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2021-11-25 19:39:00,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:39:00,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:39:00,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 19:39:00,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:39:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:39:00,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:39:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:39:00,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [433910879] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:39:00,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72968362] [2021-11-25 19:39:00,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:39:00,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:39:00,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:39:00,753 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:39:00,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-11-25 19:39:38,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:39:38,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:39:38,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 19:39:38,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:39:38,552 INFO L388 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 [2021-11-25 19:39:38,822 INFO L388 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 [2021-11-25 19:39:38,837 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:39:38,837 INFO L388 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 14 treesize of output 14 [2021-11-25 19:39:38,942 INFO L388 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 [2021-11-25 19:39:38,953 INFO L388 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 [2021-11-25 19:39:39,308 INFO L388 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 [2021-11-25 19:39:39,313 INFO L388 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 [2021-11-25 19:39:39,486 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3941) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3940))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2021-11-25 19:39:39,677 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2021-11-25 19:39:39,851 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949)))) is different from true [2021-11-25 19:39:39,871 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:39:39,890 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2021-11-25 19:39:40,228 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958))) (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2021-11-25 19:39:40,247 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:39:40,445 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:39:40,465 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:39:40,480 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:39:40,495 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:39:40,510 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972)))) is different from true [2021-11-25 19:39:40,526 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975))) (exists ((v_ArrVal_3974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3974))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2021-11-25 19:39:40,782 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980)))) is different from true [2021-11-25 19:39:40,807 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3983) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3982) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:39:40,871 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:39:40,871 INFO L388 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 [2021-11-25 19:39:40,879 INFO L388 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 [2021-11-25 19:39:41,104 INFO L388 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 [2021-11-25 19:39:41,110 INFO L388 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 [2021-11-25 19:39:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 225 not checked. [2021-11-25 19:39:41,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:39:42,034 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4031 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4030 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4030) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-11-25 19:39:42,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72968362] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:39:42,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 19:39:42,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 23] total 72 [2021-11-25 19:39:42,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146116194] [2021-11-25 19:39:42,041 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 19:39:42,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-11-25 19:39:42,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:39:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-11-25 19:39:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=2720, Unknown=40, NotChecked=2064, Total=5550 [2021-11-25 19:39:42,045 INFO L87 Difference]: Start difference. First operand 5226 states and 7768 transitions. Second operand has 72 states, 71 states have (on average 2.9577464788732395) internal successors, (210), 72 states have internal predecessors, (210), 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) [2021-11-25 19:40:29,581 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))))) (and (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975))) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3974))) (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968))) (exists ((v_ArrVal_3943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944))) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951))) (or .cse0 (bvult (bvadd (_ bv1 32) |c_#Ultimate.C_memset_#t~loopctr499|) |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_3942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3942))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965))) (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|)) (or .cse0 (bvult |c_#Ultimate.C_memset_#t~loopctr499| |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972))))) is different from true [2021-11-25 19:40:30,294 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975))) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3974))) (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968))) (exists ((v_ArrVal_3943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944))) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951))) (exists ((v_ArrVal_3942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3942))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965))) (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972)))) is different from true [2021-11-25 19:41:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:41:09,003 INFO L93 Difference]: Finished difference Result 7846 states and 11980 transitions. [2021-11-25 19:41:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-11-25 19:41:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.9577464788732395) internal successors, (210), 72 states have internal predecessors, (210), 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 97 [2021-11-25 19:41:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:41:09,019 INFO L225 Difference]: With dead ends: 7846 [2021-11-25 19:41:09,020 INFO L226 Difference]: Without dead ends: 7836 [2021-11-25 19:41:09,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 406 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=4072, Invalid=12497, Unknown=273, NotChecked=4914, Total=21756 [2021-11-25 19:41:09,028 INFO L933 BasicCegarLoop]: 1178 mSDtfsCounter, 1608 mSDsluCounter, 36728 mSDsCounter, 0 mSdLazyCounter, 26344 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 37906 SdHoareTripleChecker+Invalid, 57905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 26344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31487 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:41:09,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1621 Valid, 37906 Invalid, 57905 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [74 Valid, 26344 Invalid, 0 Unknown, 31487 Unchecked, 40.4s Time] [2021-11-25 19:41:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2021-11-25 19:41:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 5308. [2021-11-25 19:41:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 4518 states have (on average 1.718680832226649) internal successors, (7765), 5260 states have internal predecessors, (7765), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-11-25 19:41:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7863 transitions. [2021-11-25 19:41:09,105 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7863 transitions. Word has length 97 [2021-11-25 19:41:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:41:09,105 INFO L470 AbstractCegarLoop]: Abstraction has 5308 states and 7863 transitions. [2021-11-25 19:41:09,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.9577464788732395) internal successors, (210), 72 states have internal predecessors, (210), 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) [2021-11-25 19:41:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7863 transitions. [2021-11-25 19:41:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-25 19:41:09,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:41:09,107 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:41:09,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:09,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:09,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:09,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 19:41:09,726 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:41:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:41:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2043408069, now seen corresponding path program 2 times [2021-11-25 19:41:09,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:41:09,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154560817] [2021-11-25 19:41:09,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:41:09,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:41:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:41:09,728 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:41:09,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2021-11-25 19:41:10,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:41:10,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:41:10,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:41:10,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:41:10,466 INFO L388 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 [2021-11-25 19:41:10,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:41:10,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:41:10,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:41:10,537 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-11-25 19:41:10,544 INFO L388 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-11-25 19:41:10,647 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:41:10,648 INFO L388 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 17 treesize of output 17 [2021-11-25 19:41:10,743 INFO L388 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 42 treesize of output 38 [2021-11-25 19:41:10,832 INFO L388 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 42 treesize of output 38 [2021-11-25 19:41:10,921 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-25 19:41:10,922 INFO L388 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 67 treesize of output 23 [2021-11-25 19:41:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-25 19:41:11,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:41:11,110 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:41:11,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154560817] [2021-11-25 19:41:11,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154560817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:41:11,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:41:11,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 19:41:11,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32843349] [2021-11-25 19:41:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:41:11,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 19:41:11,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:41:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 19:41:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:41:11,111 INFO L87 Difference]: Start difference. First operand 5308 states and 7863 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2021-11-25 19:41:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:41:21,837 INFO L93 Difference]: Finished difference Result 5320 states and 7617 transitions. [2021-11-25 19:41:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:41:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2021-11-25 19:41:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:41:21,850 INFO L225 Difference]: With dead ends: 5320 [2021-11-25 19:41:21,850 INFO L226 Difference]: Without dead ends: 5320 [2021-11-25 19:41:21,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-25 19:41:21,851 INFO L933 BasicCegarLoop]: 1144 mSDtfsCounter, 1820 mSDsluCounter, 4734 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 5878 SdHoareTripleChecker+Invalid, 4592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:41:21,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1830 Valid, 5878 Invalid, 4592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2021-11-25 19:41:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2021-11-25 19:41:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 4907. [2021-11-25 19:41:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4907 states, 4118 states have (on average 1.741864983001457) internal successors, (7173), 4862 states have internal predecessors, (7173), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-11-25 19:41:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 7264 transitions. [2021-11-25 19:41:21,934 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 7264 transitions. Word has length 119 [2021-11-25 19:41:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:41:21,934 INFO L470 AbstractCegarLoop]: Abstraction has 4907 states and 7264 transitions. [2021-11-25 19:41:21,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2021-11-25 19:41:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 7264 transitions. [2021-11-25 19:41:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-25 19:41:21,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:41:21,937 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:41:21,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:22,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:41:22,153 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:41:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:41:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2104518823, now seen corresponding path program 1 times [2021-11-25 19:41:22,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:41:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648104396] [2021-11-25 19:41:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:41:22,155 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:41:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:41:22,156 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:41:22,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2021-11-25 19:41:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:41:23,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 19:41:23,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:41:23,229 INFO L388 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 [2021-11-25 19:41:23,371 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 19:41:23,371 INFO L388 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 22 treesize of output 29 [2021-11-25 19:41:23,414 INFO L388 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 [2021-11-25 19:41:23,550 INFO L388 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 26 treesize of output 14 [2021-11-25 19:41:25,170 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1)))))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:26,568 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1)))))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:27,272 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:27,272 INFO L388 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 38 treesize of output 39 [2021-11-25 19:41:27,438 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:27,438 INFO L388 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 41 treesize of output 42 [2021-11-25 19:41:27,484 INFO L388 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 35 treesize of output 17 [2021-11-25 19:41:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2021-11-25 19:41:27,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:41:27,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_4832) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))))))) is different from false [2021-11-25 19:41:27,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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_4832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))))))) is different from false [2021-11-25 19:41:27,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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~mem39#1.base| v_ArrVal_4878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4832)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (_ bv1 1)))) is different from false [2021-11-25 19:41:27,870 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:41:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648104396] [2021-11-25 19:41:27,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648104396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:41:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705152429] [2021-11-25 19:41:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:41:27,871 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:41:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:41:27,884 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:41:27,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2021-11-25 19:41:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:41:32,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 19:41:32,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:41:32,265 INFO L388 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 [2021-11-25 19:41:32,456 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 19:41:32,456 INFO L388 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 25 treesize of output 32 [2021-11-25 19:41:32,504 INFO L388 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 [2021-11-25 19:41:32,636 INFO L388 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 26 treesize of output 14 [2021-11-25 19:41:32,911 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1)))))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:34,583 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1)))))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:34,852 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1)))))) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:35,482 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:35,482 INFO L388 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 38 treesize of output 39 [2021-11-25 19:41:35,573 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:35,573 INFO L388 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 39 treesize of output 40 [2021-11-25 19:41:35,621 INFO L388 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 35 treesize of output 17 [2021-11-25 19:41:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2021-11-25 19:41:35,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:41:35,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5302) |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 [2021-11-25 19:41:35,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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_5302) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))))) (_ bv1 1)))) is different from false [2021-11-25 19:41:35,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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~mem39#1.base| v_ArrVal_5348))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5302)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2021-11-25 19:41:35,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1705152429] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:41:35,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856167336] [2021-11-25 19:41:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:41:35,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:41:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:41:35,960 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:41:35,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-11-25 19:41:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:41:36,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-25 19:41:36,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:41:36,644 INFO L388 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 [2021-11-25 19:41:36,784 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:41:36,784 INFO L388 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 16 treesize of output 16 [2021-11-25 19:41:36,811 INFO L388 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 [2021-11-25 19:41:36,934 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5727) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:36,940 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5728) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:36,946 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5729) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:36,977 WARN L860 $PredicateComparison]: unable to prove that (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|)) is different from true [2021-11-25 19:41:36,983 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5731) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:36,989 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5732) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:36,995 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5733) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,001 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5734) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,008 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5735) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,014 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5736) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,020 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5737) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,026 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5738))) is different from true [2021-11-25 19:41:37,032 WARN L860 $PredicateComparison]: unable to prove that (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 [2021-11-25 19:41:37,038 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5740) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,045 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5741) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,051 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5742) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,058 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5743) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,068 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5744) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,074 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5745) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,081 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5746) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,087 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5747 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5747) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,093 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5748) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,115 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5749) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,124 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5750) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,131 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5751) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,138 WARN L860 $PredicateComparison]: unable to prove that (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|)) is different from true [2021-11-25 19:41:37,144 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5753))) is different from true [2021-11-25 19:41:37,151 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5754) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,158 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5755) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,164 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5756) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,171 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5757))) is different from true [2021-11-25 19:41:37,178 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5758) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,185 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5759) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,193 WARN L860 $PredicateComparison]: unable to prove that (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 [2021-11-25 19:41:37,200 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5761) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,220 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5762) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,227 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5763) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,234 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5764) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,241 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5765) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,247 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5766) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,254 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5767) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,261 WARN L860 $PredicateComparison]: unable to prove that (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 [2021-11-25 19:41:37,267 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5769) |c_#memory_$Pointer$.base|)) is different from true [2021-11-25 19:41:37,276 WARN L860 $PredicateComparison]: unable to prove that (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 [2021-11-25 19:41:37,299 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:37,300 INFO L388 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 23 treesize of output 26 [2021-11-25 19:41:37,363 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:37,363 INFO L388 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 38 treesize of output 39 [2021-11-25 19:41:37,417 INFO L388 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 35 treesize of output 17 [2021-11-25 19:41:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2021-11-25 19:41:37,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:41:37,445 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-11-25 19:41:37,446 INFO L388 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 33 treesize of output 32 [2021-11-25 19:41:37,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem41#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5771) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2021-11-25 19:41:37,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5771) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2021-11-25 19:41:37,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5817)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_5771) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2021-11-25 19:41:37,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856167336] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:41:37,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:41:37,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 53] total 65 [2021-11-25 19:41:37,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334915055] [2021-11-25 19:41:37,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:41:37,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-25 19:41:37,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:41:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-25 19:41:37,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=292, Unknown=73, NotChecked=5162, Total=5700 [2021-11-25 19:41:37,700 INFO L87 Difference]: Start difference. First operand 4907 states and 7264 transitions. Second operand has 66 states, 63 states have (on average 2.3492063492063493) internal successors, (148), 66 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) [2021-11-25 19:41:37,997 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5727) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))))))) is different from true [2021-11-25 19:41:38,011 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5729) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 1)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_39))))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_41))))) (= (_ bv0 1) (bvadd .cse0 (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1)))))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:41:46,176 INFO L93 Difference]: Finished difference Result 7396 states and 11285 transitions. [2021-11-25 19:41:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-25 19:41:46,177 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.3492063492063493) internal successors, (148), 66 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 122 [2021-11-25 19:41:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:41:46,184 INFO L225 Difference]: With dead ends: 7396 [2021-11-25 19:41:46,184 INFO L226 Difference]: Without dead ends: 7392 [2021-11-25 19:41:46,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 220 SyntacticMatches, 92 SemanticMatches, 76 ConstructedPredicates, 60 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=177, Invalid=294, Unknown=75, NotChecked=5460, Total=6006 [2021-11-25 19:41:46,186 INFO L933 BasicCegarLoop]: 1231 mSDtfsCounter, 1594 mSDsluCounter, 9311 mSDsCounter, 0 mSdLazyCounter, 4430 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 10542 SdHoareTripleChecker+Invalid, 106163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101703 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:41:46,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1608 Valid, 10542 Invalid, 106163 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 4430 Invalid, 0 Unknown, 101703 Unchecked, 8.1s Time] [2021-11-25 19:41:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2021-11-25 19:41:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 4906. [2021-11-25 19:41:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4118 states have (on average 1.7404079650315687) internal successors, (7167), 4861 states have internal predecessors, (7167), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-11-25 19:41:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 7258 transitions. [2021-11-25 19:41:46,254 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 7258 transitions. Word has length 122 [2021-11-25 19:41:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:41:46,255 INFO L470 AbstractCegarLoop]: Abstraction has 4906 states and 7258 transitions. [2021-11-25 19:41:46,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.3492063492063493) internal successors, (148), 66 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) [2021-11-25 19:41:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 7258 transitions. [2021-11-25 19:41:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-25 19:41:46,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:41:46,257 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:41:46,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:46,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:46,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-11-25 19:41:46,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:41:46,877 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:41:46,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:41:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2104518822, now seen corresponding path program 1 times [2021-11-25 19:41:46,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:41:46,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835886457] [2021-11-25 19:41:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:41:46,879 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:41:46,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:41:46,879 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:41:46,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2021-11-25 19:41:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:41:47,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 19:41:47,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:41:48,005 INFO L388 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 [2021-11-25 19:41:48,219 INFO L388 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 [2021-11-25 19:41:48,230 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:41:48,230 INFO L388 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 14 treesize of output 14 [2021-11-25 19:41:48,253 INFO L388 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 [2021-11-25 19:41:48,261 INFO L388 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 [2021-11-25 19:41:48,365 INFO L388 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 [2021-11-25 19:41:48,369 INFO L388 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 [2021-11-25 19:41:48,433 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:48,445 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201)))) is different from true [2021-11-25 19:41:48,459 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:48,472 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:48,545 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210)))) is different from true [2021-11-25 19:41:48,563 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:48,677 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:48,694 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:48,711 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222)))) is different from true [2021-11-25 19:41:48,819 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:48,883 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:48,902 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234)))) is different from true [2021-11-25 19:41:48,920 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235)))) is different from true [2021-11-25 19:41:49,020 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:49,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244)))) is different from true [2021-11-25 19:41:49,081 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:49,095 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:49,110 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252)))) is different from true [2021-11-25 19:41:49,191 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257)))) is different from true [2021-11-25 19:41:49,205 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:49,286 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266)))) is different from true [2021-11-25 19:41:49,300 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:49,314 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:49,328 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:49,342 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:49,357 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:49,371 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32)))) is different from true [2021-11-25 19:41:49,387 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:41:49,487 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:41:49,540 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:49,540 INFO L388 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 [2021-11-25 19:41:49,546 INFO L388 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 [2021-11-25 19:41:49,674 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:41:49,674 INFO L388 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 [2021-11-25 19:41:49,680 INFO L388 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 [2021-11-25 19:41:49,722 INFO L388 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 [2021-11-25 19:41:49,728 INFO L388 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 [2021-11-25 19:41:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2021-11-25 19:41:49,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:41:50,043 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6287) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6287) |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_6288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 19:41:50,083 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:41:51,045 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6379) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6380) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6380)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6379) .cse2 v_ArrVal_6287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:41:51,055 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:41:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835886457] [2021-11-25 19:41:51,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835886457] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:41:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2125566746] [2021-11-25 19:41:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:41:51,056 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:41:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:41:51,056 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:41:51,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2021-11-25 19:43:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:43:58,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2021-11-25 19:43:58,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:43:58,381 INFO L388 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 [2021-11-25 19:43:58,583 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:43:58,583 INFO L388 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 16 treesize of output 16 [2021-11-25 19:43:58,592 INFO L388 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 [2021-11-25 19:43:58,610 INFO L388 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 [2021-11-25 19:43:58,621 INFO L388 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 [2021-11-25 19:43:58,704 INFO L388 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 [2021-11-25 19:43:58,711 INFO L388 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 [2021-11-25 19:43:58,789 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6763))) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6762) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,805 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:43:58,819 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,838 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,878 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,892 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,906 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774)))) is different from true [2021-11-25 19:43:58,920 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6777))) (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,935 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6778) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6779) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,949 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6780) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6781) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:58,963 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,009 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,061 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:43:59,074 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793)))) is different from true [2021-11-25 19:43:59,089 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:43:59,227 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802)))) is different from true [2021-11-25 19:43:59,246 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805)))) is different from true [2021-11-25 19:43:59,261 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,377 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815)))) is different from true [2021-11-25 19:43:59,391 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:43:59,405 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,419 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821)))) is different from true [2021-11-25 19:43:59,436 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822)))) is different from true [2021-11-25 19:43:59,485 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,568 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,588 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,602 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,616 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838)))) is different from true [2021-11-25 19:43:59,630 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:43:59,849 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:43:59,850 INFO L388 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 [2021-11-25 19:43:59,858 INFO L388 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 [2021-11-25 19:43:59,963 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:43:59,964 INFO L388 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 [2021-11-25 19:43:59,970 INFO L388 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 [2021-11-25 19:44:00,004 INFO L388 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 [2021-11-25 19:44:00,008 INFO L388 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 [2021-11-25 19:44:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2021-11-25 19:44:00,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:44:00,087 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_6850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6850) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-11-25 19:44:00,122 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:44:00,937 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6942)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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~mem39#1.base| v_ArrVal_6943) .cse0 v_ArrVal_6850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6943) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6942) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2021-11-25 19:44:00,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2125566746] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:44:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026715401] [2021-11-25 19:44:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:44:00,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:44:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:44:00,957 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:44:00,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-25 19:44:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:44:01,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 19:44:01,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:44:01,695 INFO L388 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 [2021-11-25 19:44:01,825 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:44:01,826 INFO L388 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 15 treesize of output 15 [2021-11-25 19:44:01,832 INFO L388 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 [2021-11-25 19:44:01,841 INFO L388 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 [2021-11-25 19:44:01,851 INFO L388 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 [2021-11-25 19:44:01,909 INFO L388 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 [2021-11-25 19:44:01,912 INFO L388 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 [2021-11-25 19:44:01,977 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7326) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7325)))) is different from true [2021-11-25 19:44:01,992 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328)))) is different from true [2021-11-25 19:44:02,007 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32)))) is different from true [2021-11-25 19:44:02,022 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7332) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7331)))) is different from true [2021-11-25 19:44:02,073 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,088 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:02,103 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:02,117 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:02,133 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344)))) is different from true [2021-11-25 19:44:02,186 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,202 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350)))) is different from true [2021-11-25 19:44:02,217 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:02,233 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:02,322 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,338 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362)))) is different from true [2021-11-25 19:44:02,352 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,367 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,494 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,590 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,601 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383)))) is different from true [2021-11-25 19:44:02,614 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,664 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:02,731 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396)))) is different from true [2021-11-25 19:44:02,860 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:02,872 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408)))) is different from true [2021-11-25 19:44:02,938 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:03,005 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:44:03,005 INFO L388 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 [2021-11-25 19:44:03,013 INFO L388 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 [2021-11-25 19:44:03,123 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:44:03,123 INFO L388 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 [2021-11-25 19:44:03,130 INFO L388 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 [2021-11-25 19:44:03,171 INFO L388 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 [2021-11-25 19:44:03,177 INFO L388 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 [2021-11-25 19:44:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2021-11-25 19:44:03,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:44:03,278 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_7414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7414) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-11-25 19:44:03,316 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-11-25 19:44:04,145 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7505)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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~mem39#1.base| v_ArrVal_7506) .cse0 v_ArrVal_7414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7506) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-11-25 19:44:04,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026715401] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:44:04,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:44:04,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 35] total 93 [2021-11-25 19:44:04,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877333859] [2021-11-25 19:44:04,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:44:04,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2021-11-25 19:44:04,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:44:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-11-25 19:44:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=189, Unknown=102, NotChecked=10416, Total=10920 [2021-11-25 19:44:04,157 INFO L87 Difference]: Start difference. First operand 4906 states and 7258 transitions. Second operand has 94 states, 92 states have (on average 2.0652173913043477) internal successors, (190), 94 states have internal predecessors, (190), 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) [2021-11-25 19:44:04,760 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328))) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201)))) is different from true [2021-11-25 19:44:04,772 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,786 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7332) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7331))) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,801 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,817 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,834 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,852 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6777))) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,869 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6779) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,889 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_6780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6780) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,907 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,923 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814))) (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247))) (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209))) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840))) (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266))) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244))) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:04,927 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_62 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_62) (_ bv44 32))) (exists ((v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7411) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207))) (exists ((v_ArrVal_7412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7412) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:44:17,141 INFO L93 Difference]: Finished difference Result 7361 states and 11207 transitions. [2021-11-25 19:44:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:44:17,148 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 92 states have (on average 2.0652173913043477) internal successors, (190), 94 states have internal predecessors, (190), 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 122 [2021-11-25 19:44:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:44:17,156 INFO L225 Difference]: With dead ends: 7361 [2021-11-25 19:44:17,156 INFO L226 Difference]: Without dead ends: 7361 [2021-11-25 19:44:17,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 228 SyntacticMatches, 54 SemanticMatches, 122 ConstructedPredicates, 105 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=282, Invalid=359, Unknown=121, NotChecked=14490, Total=15252 [2021-11-25 19:44:17,159 INFO L933 BasicCegarLoop]: 1189 mSDtfsCounter, 1583 mSDsluCounter, 5106 mSDsCounter, 0 mSdLazyCounter, 5975 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 6295 SdHoareTripleChecker+Invalid, 240709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234718 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:44:17,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1592 Valid, 6295 Invalid, 240709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5975 Invalid, 0 Unknown, 234718 Unchecked, 12.0s Time] [2021-11-25 19:44:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2021-11-25 19:44:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 4905. [2021-11-25 19:44:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4905 states, 4118 states have (on average 1.7396794560466247) internal successors, (7164), 4860 states have internal predecessors, (7164), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-11-25 19:44:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 7255 transitions. [2021-11-25 19:44:17,226 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 7255 transitions. Word has length 122 [2021-11-25 19:44:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:44:17,226 INFO L470 AbstractCegarLoop]: Abstraction has 4905 states and 7255 transitions. [2021-11-25 19:44:17,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 92 states have (on average 2.0652173913043477) internal successors, (190), 94 states have internal predecessors, (190), 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) [2021-11-25 19:44:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 7255 transitions. [2021-11-25 19:44:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-25 19:44:17,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:44:17,227 INFO L514 BasicCegarLoop]: 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] [2021-11-25 19:44:17,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2021-11-25 19:44:17,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (50)] Ended with exit code 0 [2021-11-25 19:44:17,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2021-11-25 19:44:17,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 19:44:17,845 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1091 more)] === [2021-11-25 19:44:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:44:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2082306569, now seen corresponding path program 1 times [2021-11-25 19:44:17,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:44:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648316452] [2021-11-25 19:44:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:44:17,847 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:44:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:44:17,848 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:44:17,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2021-11-25 19:44:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:44:19,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-25 19:44:19,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:44:19,120 INFO L388 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 [2021-11-25 19:44:19,247 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:44:19,248 INFO L388 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 15 treesize of output 15 [2021-11-25 19:44:19,255 INFO L388 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 [2021-11-25 19:44:19,273 INFO L388 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 [2021-11-25 19:44:19,282 INFO L388 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 [2021-11-25 19:44:19,372 INFO L388 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 [2021-11-25 19:44:19,375 INFO L388 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 [2021-11-25 19:44:19,466 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7906))) (exists ((v_ArrVal_7905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7905) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,479 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7908) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7907) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:19,491 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7909) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7910) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,504 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7911))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7912) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:19,517 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7913) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7914) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,562 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7918))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,606 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7922) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7921) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:19,653 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7926) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,699 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7930) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7929)))) is different from true [2021-11-25 19:44:19,780 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7935) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7936))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,793 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7937) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7938) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:19,840 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7941))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,854 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7943) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7944)))) is different from true [2021-11-25 19:44:19,867 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7946) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7945) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:19,880 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7948) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7947) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:19,894 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7949) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7950) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:19,908 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7951))) (exists ((v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7952) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:20,028 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7958) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7957) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:20,041 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7960) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:44:20,088 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7963))) (exists ((v_ArrVal_7964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7964) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:20,221 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7972) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:20,285 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7975) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7976)))) is different from true [2021-11-25 19:44:20,303 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7978) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7977 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7977) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:20,319 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7980)))) is different from true [2021-11-25 19:44:20,332 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7981))) (exists ((v_ArrVal_7982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7982) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:20,345 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7983) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:20,364 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7985) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7986)))) is different from true [2021-11-25 19:44:20,382 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7987) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7988) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 19:44:20,399 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7990 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7990) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7989) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:44:20,458 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:44:20,458 INFO L388 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 [2021-11-25 19:44:20,470 INFO L388 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 [2021-11-25 19:44:20,587 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:44:20,587 INFO L388 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 [2021-11-25 19:44:20,595 INFO L388 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 [2021-11-25 19:44:20,706 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:44:20,706 INFO L388 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 [2021-11-25 19:44:20,712 INFO L388 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 [2021-11-25 19:44:20,744 INFO L388 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 [2021-11-25 19:44:20,748 INFO L388 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 [2021-11-25 19:44:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2021-11-25 19:44:20,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:44:20,975 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 19:44:21,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:44:21,073 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7991 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7992)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7991) .cse0 v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7991 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7991) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3))))) is different from false [2021-11-25 19:44:21,124 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7991 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7992))) (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_7991) .cse1 v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7991 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_7991) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_7992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_7993)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-11-25 19:44:23,181 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7991 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8086))) (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~mem39#1.base| v_ArrVal_8085) .cse1 v_ArrVal_7991) (select (select (store .cse2 .cse1 v_ArrVal_7992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7993))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7991 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8086)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7992))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8085) .cse4 v_ArrVal_7991) .cse5 v_ArrVal_7993) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-11-25 19:44:23,197 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:44:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648316452] [2021-11-25 19:44:23,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648316452] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:44:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1008421864] [2021-11-25 19:44:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:44:23,197 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:44:23,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:44:23,198 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:44:23,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f54a989f-9706-42da-a9fb-c9e58d4e9fc3/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process