./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:54:00,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:54:00,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:54:00,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:54:00,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:54:00,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:54:00,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:54:00,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:54:00,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:54:00,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:54:00,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:54:00,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:54:00,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:54:00,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:54:00,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:54:00,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:54:00,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:54:00,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:54:00,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:54:00,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:54:00,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:54:00,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:54:00,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:54:00,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:54:00,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:54:00,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:54:00,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:54:00,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:54:00,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:54:00,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:54:00,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:54:00,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:54:00,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:54:00,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:54:00,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:54:00,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:54:00,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:54:00,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:54:00,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:54:00,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:54:00,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:54:00,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:54:00,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:54:00,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:54:00,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:54:00,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:54:00,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:54:00,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:54:00,534 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:54:00,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:54:00,535 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:54:00,535 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:54:00,536 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:54:00,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:54:00,537 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:54:00,537 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:54:00,538 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:54:00,538 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:54:00,538 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:54:00,538 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:54:00,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:54:00,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:54:00,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:54:00,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:54:00,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:54:00,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:54:00,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:54:00,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:54:00,543 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:54:00,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:54:00,544 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:54:00,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:54:00,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:54:00,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:54:00,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:54:00,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:54:00,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:54:00,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:54:00,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:54:00,546 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:54:00,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:54:00,547 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:54:00,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:54:00,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:54:00,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2022-11-19 07:54:00,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:54:00,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:54:00,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:54:00,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:54:00,852 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:54:00,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-11-19 07:54:00,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/d3c1c3923/aec84677abc0400c9bebd545e9e2972f/FLAGc80055da6 [2022-11-19 07:54:01,464 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:54:01,464 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-11-19 07:54:01,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/d3c1c3923/aec84677abc0400c9bebd545e9e2972f/FLAGc80055da6 [2022-11-19 07:54:01,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/d3c1c3923/aec84677abc0400c9bebd545e9e2972f [2022-11-19 07:54:01,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:54:01,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:54:01,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:54:01,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:54:01,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:54:01,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:01" (1/1) ... [2022-11-19 07:54:01,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ded8e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:01, skipping insertion in model container [2022-11-19 07:54:01,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:01" (1/1) ... [2022-11-19 07:54:01,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:54:01,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:54:02,347 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-11-19 07:54:02,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:54:02,508 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-19 07:54:02,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4178e814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:02, skipping insertion in model container [2022-11-19 07:54:02,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:54:02,510 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-19 07:54:02,511 INFO L158 Benchmark]: Toolchain (without parser) took 755.45ms. Allocated memory is still 119.5MB. Free memory was 80.0MB in the beginning and 85.9MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:54:02,512 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:54:02,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.93ms. Allocated memory is still 119.5MB. Free memory was 79.8MB in the beginning and 86.4MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:54:02,515 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.28ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 749.93ms. Allocated memory is still 119.5MB. Free memory was 79.8MB in the beginning and 86.4MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:54:04,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:54:04,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:54:04,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:54:04,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:54:04,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:54:04,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:54:04,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:54:04,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:54:04,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:54:04,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:54:04,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:54:04,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:54:04,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:54:04,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:54:04,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:54:04,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:54:04,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:54:04,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:54:04,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:54:04,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:54:04,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:54:04,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:54:04,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:54:04,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:54:04,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:54:04,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:54:04,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:54:04,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:54:04,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:54:04,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:54:04,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:54:04,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:54:04,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:54:04,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:54:04,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:54:04,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:54:04,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:54:04,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:54:04,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:54:04,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:54:04,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:54:04,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:54:04,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:54:04,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:54:04,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:54:04,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:54:04,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:54:04,759 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:54:04,760 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:54:04,760 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:54:04,760 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:54:04,761 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:54:04,762 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:54:04,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:54:04,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:54:04,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:54:04,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:54:04,765 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:54:04,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:54:04,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:54:04,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:54:04,766 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:54:04,766 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:54:04,767 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:54:04,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:54:04,767 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:54:04,767 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:54:04,768 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:54:04,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:54:04,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:54:04,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:54:04,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:54:04,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:54:04,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:54:04,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:54:04,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:54:04,771 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:54:04,771 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:54:04,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:54:04,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:54:04,772 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_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2022-11-19 07:54:05,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:54:05,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:54:05,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:54:05,199 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:54:05,200 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:54:05,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-11-19 07:54:05,299 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/e91b1e18d/bbb1afaa52d3479595e168623a4feacc/FLAGbc7a3ae64 [2022-11-19 07:54:05,987 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:54:05,987 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2022-11-19 07:54:06,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/e91b1e18d/bbb1afaa52d3479595e168623a4feacc/FLAGbc7a3ae64 [2022-11-19 07:54:06,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/data/e91b1e18d/bbb1afaa52d3479595e168623a4feacc [2022-11-19 07:54:06,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:54:06,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:54:06,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:54:06,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:54:06,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:54:06,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:06" (1/1) ... [2022-11-19 07:54:06,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a360b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:06, skipping insertion in model container [2022-11-19 07:54:06,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:06" (1/1) ... [2022-11-19 07:54:06,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:54:06,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:54:06,784 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-11-19 07:54:06,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:54:06,966 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-19 07:54:06,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:54:07,019 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-11-19 07:54:07,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:54:07,094 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:54:07,126 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2022-11-19 07:54:07,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:54:07,246 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:54:07,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07 WrapperNode [2022-11-19 07:54:07,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:54:07,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:54:07,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:54:07,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:54:07,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,361 INFO L138 Inliner]: procedures = 180, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 788 [2022-11-19 07:54:07,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:54:07,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:54:07,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:54:07,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:54:07,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,470 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:54:07,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:54:07,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:54:07,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:54:07,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (1/1) ... [2022-11-19 07:54:07,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:54:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:07,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:54:07,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:54:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-19 07:54:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 07:54:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 07:54:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 07:54:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-19 07:54:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-19 07:54:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:54:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:54:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:54:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:54:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:54:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:54:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:54:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:54:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:54:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:54:07,806 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:54:07,808 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:54:07,812 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-19 07:54:11,645 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:54:11,656 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:54:11,656 INFO L300 CfgBuilder]: Removed 40 assume(true) statements. [2022-11-19 07:54:11,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:11 BoogieIcfgContainer [2022-11-19 07:54:11,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:54:11,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:54:11,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:54:11,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:54:11,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:54:06" (1/3) ... [2022-11-19 07:54:11,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526f2aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:11, skipping insertion in model container [2022-11-19 07:54:11,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:07" (2/3) ... [2022-11-19 07:54:11,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526f2aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:11, skipping insertion in model container [2022-11-19 07:54:11,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:11" (3/3) ... [2022-11-19 07:54:11,668 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-2.i [2022-11-19 07:54:11,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:54:11,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2022-11-19 07:54:11,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:54:11,771 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fc6f077, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:54:11,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2022-11-19 07:54:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 866 states, 418 states have (on average 2.2535885167464116) internal successors, (942), 860 states have internal predecessors, (942), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:54:11,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:11,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:54:11,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-19 07:54:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:11,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580630341] [2022-11-19 07:54:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:11,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:11,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-19 07:54:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:11,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:54:11,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:12,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:12,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580630341] [2022-11-19 07:54:12,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580630341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:12,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:12,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:54:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812910113] [2022-11-19 07:54:12,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:12,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:54:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:54:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:54:12,073 INFO L87 Difference]: Start difference. First operand has 866 states, 418 states have (on average 2.2535885167464116) internal successors, (942), 860 states have internal predecessors, (942), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:12,179 INFO L93 Difference]: Finished difference Result 857 states and 914 transitions. [2022-11-19 07:54:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:54:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 07:54:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:12,202 INFO L225 Difference]: With dead ends: 857 [2022-11-19 07:54:12,202 INFO L226 Difference]: Without dead ends: 855 [2022-11-19 07:54:12,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:54:12,207 INFO L413 NwaCegarLoop]: 914 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:12,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:54:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-19 07:54:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-19 07:54:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 413 states have (on average 2.1452784503631963) internal successors, (886), 849 states have internal predecessors, (886), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 912 transitions. [2022-11-19 07:54:12,293 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 912 transitions. Word has length 5 [2022-11-19 07:54:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:12,294 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 912 transitions. [2022-11-19 07:54:12,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 912 transitions. [2022-11-19 07:54:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:54:12,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:12,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:54:12,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:12,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:12,507 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-19 07:54:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:12,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688227312] [2022-11-19 07:54:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:12,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:12,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:12,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:12,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-19 07:54:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:12,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:54:12,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:12,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 07:54:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:12,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:12,722 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688227312] [2022-11-19 07:54:12,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688227312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:12,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:54:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826684315] [2022-11-19 07:54:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:12,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:12,737 INFO L87 Difference]: Start difference. First operand 855 states and 912 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:14,519 INFO L93 Difference]: Finished difference Result 813 states and 871 transitions. [2022-11-19 07:54:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:14,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 07:54:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:14,524 INFO L225 Difference]: With dead ends: 813 [2022-11-19 07:54:14,524 INFO L226 Difference]: Without dead ends: 813 [2022-11-19 07:54:14,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:14,526 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 594 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:14,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 660 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-19 07:54:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-11-19 07:54:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 806. [2022-11-19 07:54:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 413 states have (on average 2.026634382566586) internal successors, (837), 800 states have internal predecessors, (837), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 863 transitions. [2022-11-19 07:54:14,554 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 863 transitions. Word has length 5 [2022-11-19 07:54:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:14,555 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 863 transitions. [2022-11-19 07:54:14,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 863 transitions. [2022-11-19 07:54:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:54:14,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:14,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:54:14,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:14,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:14,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-19 07:54:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:14,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057607252] [2022-11-19 07:54:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:14,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:14,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:14,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-19 07:54:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:14,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:54:14,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:14,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:54:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:14,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:14,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:14,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057607252] [2022-11-19 07:54:14,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057607252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:14,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:14,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:54:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922282580] [2022-11-19 07:54:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:14,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:14,937 INFO L87 Difference]: Start difference. First operand 806 states and 863 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:17,366 INFO L93 Difference]: Finished difference Result 873 states and 934 transitions. [2022-11-19 07:54:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 07:54:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:17,373 INFO L225 Difference]: With dead ends: 873 [2022-11-19 07:54:17,373 INFO L226 Difference]: Without dead ends: 873 [2022-11-19 07:54:17,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:17,375 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 254 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:17,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1061 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-19 07:54:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-11-19 07:54:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 828. [2022-11-19 07:54:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 445 states have (on average 2.006741573033708) internal successors, (893), 822 states have internal predecessors, (893), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 919 transitions. [2022-11-19 07:54:17,405 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 919 transitions. Word has length 5 [2022-11-19 07:54:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 919 transitions. [2022-11-19 07:54:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 919 transitions. [2022-11-19 07:54:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:54:17,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:17,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 07:54:17,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:17,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:17,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1156729148, now seen corresponding path program 1 times [2022-11-19 07:54:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:17,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991319602] [2022-11-19 07:54:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:17,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:17,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:17,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-19 07:54:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:17,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:54:17,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:17,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:17,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991319602] [2022-11-19 07:54:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991319602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:17,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:17,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958171483] [2022-11-19 07:54:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:17,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:17,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:17,745 INFO L87 Difference]: Start difference. First operand 828 states and 919 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:17,847 INFO L93 Difference]: Finished difference Result 1408 states and 1559 transitions. [2022-11-19 07:54:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:17,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 07:54:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:17,856 INFO L225 Difference]: With dead ends: 1408 [2022-11-19 07:54:17,856 INFO L226 Difference]: Without dead ends: 1408 [2022-11-19 07:54:17,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:17,857 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 567 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:17,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1919 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:54:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-11-19 07:54:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 829. [2022-11-19 07:54:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 446 states have (on average 2.004484304932735) internal successors, (894), 823 states have internal predecessors, (894), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 920 transitions. [2022-11-19 07:54:17,882 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 920 transitions. Word has length 6 [2022-11-19 07:54:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:17,882 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 920 transitions. [2022-11-19 07:54:17,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 920 transitions. [2022-11-19 07:54:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:54:17,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:17,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:17,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:18,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:18,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-19 07:54:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:18,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335363821] [2022-11-19 07:54:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:18,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:18,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-19 07:54:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:18,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:54:18,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:18,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:18,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:18,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335363821] [2022-11-19 07:54:18,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335363821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:18,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:18,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684006799] [2022-11-19 07:54:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:18,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:18,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:18,277 INFO L87 Difference]: Start difference. First operand 829 states and 920 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:18,314 INFO L93 Difference]: Finished difference Result 793 states and 883 transitions. [2022-11-19 07:54:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:54:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:18,318 INFO L225 Difference]: With dead ends: 793 [2022-11-19 07:54:18,318 INFO L226 Difference]: Without dead ends: 793 [2022-11-19 07:54:18,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:18,319 INFO L413 NwaCegarLoop]: 805 mSDtfsCounter, 771 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:18,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 835 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:54:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-11-19 07:54:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 787. [2022-11-19 07:54:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 428 states have (on average 1.9883177570093458) internal successors, (851), 781 states have internal predecessors, (851), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 877 transitions. [2022-11-19 07:54:18,338 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 877 transitions. Word has length 11 [2022-11-19 07:54:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:18,339 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 877 transitions. [2022-11-19 07:54:18,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 877 transitions. [2022-11-19 07:54:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:54:18,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:18,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:18,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:18,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-19 07:54:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:18,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970241639] [2022-11-19 07:54:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:18,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:18,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:18,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:18,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-19 07:54:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:18,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:54:18,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:18,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:18,719 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:18,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970241639] [2022-11-19 07:54:18,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970241639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:18,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:18,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227623168] [2022-11-19 07:54:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:18,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:18,722 INFO L87 Difference]: Start difference. First operand 787 states and 877 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:18,812 INFO L93 Difference]: Finished difference Result 772 states and 855 transitions. [2022-11-19 07:54:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:54:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:54:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:18,816 INFO L225 Difference]: With dead ends: 772 [2022-11-19 07:54:18,816 INFO L226 Difference]: Without dead ends: 772 [2022-11-19 07:54:18,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:18,817 INFO L413 NwaCegarLoop]: 760 mSDtfsCounter, 752 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:18,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1543 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:54:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-11-19 07:54:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 765. [2022-11-19 07:54:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 420 states have (on average 1.957142857142857) internal successors, (822), 759 states have internal predecessors, (822), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 848 transitions. [2022-11-19 07:54:18,835 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 848 transitions. Word has length 13 [2022-11-19 07:54:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:18,835 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 848 transitions. [2022-11-19 07:54:18,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 848 transitions. [2022-11-19 07:54:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:54:18,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:18,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:18,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:19,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:19,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-19 07:54:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:19,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165445487] [2022-11-19 07:54:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:19,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:19,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:19,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:19,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-19 07:54:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:19,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:54:19,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:19,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 07:54:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:19,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:19,292 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:19,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165445487] [2022-11-19 07:54:19,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165445487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:19,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:19,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132881945] [2022-11-19 07:54:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:19,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:19,295 INFO L87 Difference]: Start difference. First operand 765 states and 848 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:21,513 INFO L93 Difference]: Finished difference Result 992 states and 1106 transitions. [2022-11-19 07:54:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:54:21,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:54:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:21,517 INFO L225 Difference]: With dead ends: 992 [2022-11-19 07:54:21,517 INFO L226 Difference]: Without dead ends: 992 [2022-11-19 07:54:21,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:21,518 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 1147 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:21,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 716 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-19 07:54:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-19 07:54:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 761. [2022-11-19 07:54:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 420 states have (on average 1.9476190476190476) internal successors, (818), 755 states have internal predecessors, (818), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 844 transitions. [2022-11-19 07:54:21,543 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 844 transitions. Word has length 27 [2022-11-19 07:54:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:21,544 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 844 transitions. [2022-11-19 07:54:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 844 transitions. [2022-11-19 07:54:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:54:21,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:21,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:21,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:21,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-19 07:54:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034176954] [2022-11-19 07:54:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:21,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:21,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:21,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-19 07:54:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:21,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:54:21,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:21,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:54:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:22,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:22,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034176954] [2022-11-19 07:54:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034176954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:22,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012507782] [2022-11-19 07:54:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:22,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:22,173 INFO L87 Difference]: Start difference. First operand 761 states and 844 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:25,458 INFO L93 Difference]: Finished difference Result 1042 states and 1126 transitions. [2022-11-19 07:54:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:54:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:54:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:25,463 INFO L225 Difference]: With dead ends: 1042 [2022-11-19 07:54:25,463 INFO L226 Difference]: Without dead ends: 1042 [2022-11-19 07:54:25,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:25,464 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 561 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:25,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1248 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-19 07:54:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-11-19 07:54:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 757. [2022-11-19 07:54:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 420 states have (on average 1.938095238095238) internal successors, (814), 751 states have internal predecessors, (814), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 840 transitions. [2022-11-19 07:54:25,482 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 840 transitions. Word has length 27 [2022-11-19 07:54:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:25,482 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 840 transitions. [2022-11-19 07:54:25,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 840 transitions. [2022-11-19 07:54:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-19 07:54:25,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:25,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:25,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:25,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:25,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-19 07:54:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:25,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847546941] [2022-11-19 07:54:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:25,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:25,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:25,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:25,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-19 07:54:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:25,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:54:25,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:25,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:25,972 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:25,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847546941] [2022-11-19 07:54:25,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847546941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:25,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:25,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855695828] [2022-11-19 07:54:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:25,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:25,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:25,975 INFO L87 Difference]: Start difference. First operand 757 states and 840 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:26,035 INFO L93 Difference]: Finished difference Result 757 states and 836 transitions. [2022-11-19 07:54:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:54:26,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-19 07:54:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:26,039 INFO L225 Difference]: With dead ends: 757 [2022-11-19 07:54:26,039 INFO L226 Difference]: Without dead ends: 757 [2022-11-19 07:54:26,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:26,040 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 721 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:26,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1521 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:54:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-11-19 07:54:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 751. [2022-11-19 07:54:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 414 states have (on average 1.9420289855072463) internal successors, (804), 745 states have internal predecessors, (804), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 830 transitions. [2022-11-19 07:54:26,062 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 830 transitions. Word has length 42 [2022-11-19 07:54:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:26,064 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 830 transitions. [2022-11-19 07:54:26,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 830 transitions. [2022-11-19 07:54:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 07:54:26,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:26,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:26,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:26,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:26,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-19 07:54:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036473429] [2022-11-19 07:54:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:26,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:26,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:26,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:26,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-19 07:54:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:26,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:54:26,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:26,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:26,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036473429] [2022-11-19 07:54:26,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036473429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:26,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:26,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628918525] [2022-11-19 07:54:26,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:26,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:26,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:26,777 INFO L87 Difference]: Start difference. First operand 751 states and 830 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:27,037 INFO L93 Difference]: Finished difference Result 992 states and 1080 transitions. [2022-11-19 07:54:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:27,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-19 07:54:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:27,042 INFO L225 Difference]: With dead ends: 992 [2022-11-19 07:54:27,042 INFO L226 Difference]: Without dead ends: 992 [2022-11-19 07:54:27,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:27,044 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 269 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:27,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1461 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:54:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-19 07:54:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 797. [2022-11-19 07:54:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 460 states have (on average 1.8478260869565217) internal successors, (850), 791 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 876 transitions. [2022-11-19 07:54:27,065 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 876 transitions. Word has length 50 [2022-11-19 07:54:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:27,067 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 876 transitions. [2022-11-19 07:54:27,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 876 transitions. [2022-11-19 07:54:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 07:54:27,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:27,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:27,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:27,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:27,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-19 07:54:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828501274] [2022-11-19 07:54:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:27,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:27,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-19 07:54:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:27,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:54:27,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:27,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 07:54:27,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:54:28,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:54:28,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 07:54:28,253 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:54:28,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:54:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:28,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:28,273 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:28,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828501274] [2022-11-19 07:54:28,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828501274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:28,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:28,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701463592] [2022-11-19 07:54:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:28,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:28,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:28,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:28,275 INFO L87 Difference]: Start difference. First operand 797 states and 876 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:30,124 INFO L93 Difference]: Finished difference Result 766 states and 846 transitions. [2022-11-19 07:54:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:54:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-19 07:54:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:30,130 INFO L225 Difference]: With dead ends: 766 [2022-11-19 07:54:30,130 INFO L226 Difference]: Without dead ends: 766 [2022-11-19 07:54:30,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:30,131 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 825 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:30,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 571 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-19 07:54:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-19 07:54:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 727. [2022-11-19 07:54:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 428 states have (on average 1.7429906542056075) internal successors, (746), 721 states have internal predecessors, (746), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 772 transitions. [2022-11-19 07:54:30,147 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 772 transitions. Word has length 53 [2022-11-19 07:54:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:30,147 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 772 transitions. [2022-11-19 07:54:30,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 772 transitions. [2022-11-19 07:54:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 07:54:30,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:30,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:30,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-19 07:54:30,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:30,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-19 07:54:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800970989] [2022-11-19 07:54:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:30,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:30,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:30,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-19 07:54:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:30,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:54:30,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:30,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 07:54:30,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:54:30,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 07:54:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:30,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:30,725 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:30,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800970989] [2022-11-19 07:54:30,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800970989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:30,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56443997] [2022-11-19 07:54:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:30,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:54:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:30,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:54:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:30,730 INFO L87 Difference]: Start difference. First operand 727 states and 772 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:33,074 INFO L93 Difference]: Finished difference Result 726 states and 771 transitions. [2022-11-19 07:54:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:54:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-19 07:54:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:33,079 INFO L225 Difference]: With dead ends: 726 [2022-11-19 07:54:33,079 INFO L226 Difference]: Without dead ends: 726 [2022-11-19 07:54:33,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:54:33,080 INFO L413 NwaCegarLoop]: 720 mSDtfsCounter, 4 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:33,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1842 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-19 07:54:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-11-19 07:54:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2022-11-19 07:54:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 428 states have (on average 1.7406542056074767) internal successors, (745), 720 states have internal predecessors, (745), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 771 transitions. [2022-11-19 07:54:33,094 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 771 transitions. Word has length 58 [2022-11-19 07:54:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:33,095 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 771 transitions. [2022-11-19 07:54:33,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 771 transitions. [2022-11-19 07:54:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 07:54:33,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:33,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:33,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:33,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:33,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-19 07:54:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:33,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899834348] [2022-11-19 07:54:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:33,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:33,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:33,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-19 07:54:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:33,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 07:54:33,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:33,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:54:33,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:54:33,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:54:33,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-19 07:54:33,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 07:54:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:33,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:33,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:33,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899834348] [2022-11-19 07:54:33,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899834348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:33,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:33,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80578864] [2022-11-19 07:54:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:33,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:54:33,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:33,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:54:33,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:33,727 INFO L87 Difference]: Start difference. First operand 726 states and 771 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:36,701 INFO L93 Difference]: Finished difference Result 725 states and 770 transitions. [2022-11-19 07:54:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:54:36,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-19 07:54:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:36,705 INFO L225 Difference]: With dead ends: 725 [2022-11-19 07:54:36,706 INFO L226 Difference]: Without dead ends: 725 [2022-11-19 07:54:36,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:54:36,706 INFO L413 NwaCegarLoop]: 720 mSDtfsCounter, 2 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:36,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1868 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-19 07:54:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-11-19 07:54:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2022-11-19 07:54:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 427 states have (on average 1.7423887587822013) internal successors, (744), 719 states have internal predecessors, (744), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:54:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 770 transitions. [2022-11-19 07:54:36,732 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 770 transitions. Word has length 58 [2022-11-19 07:54:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:36,732 INFO L495 AbstractCegarLoop]: Abstraction has 725 states and 770 transitions. [2022-11-19 07:54:36,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 770 transitions. [2022-11-19 07:54:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 07:54:36,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:36,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:36,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:36,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:36,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1015821406, now seen corresponding path program 1 times [2022-11-19 07:54:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:36,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935358669] [2022-11-19 07:54:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:36,958 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:36,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-19 07:54:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:37,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:54:37,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:37,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:37,289 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:37,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935358669] [2022-11-19 07:54:37,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935358669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:37,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:37,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399608572] [2022-11-19 07:54:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:37,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:37,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:37,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:37,292 INFO L87 Difference]: Start difference. First operand 725 states and 770 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:54:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:37,340 INFO L93 Difference]: Finished difference Result 728 states and 774 transitions. [2022-11-19 07:54:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:54:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-19 07:54:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:37,344 INFO L225 Difference]: With dead ends: 728 [2022-11-19 07:54:37,345 INFO L226 Difference]: Without dead ends: 728 [2022-11-19 07:54:37,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:54:37,345 INFO L413 NwaCegarLoop]: 720 mSDtfsCounter, 2 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:37,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2155 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:54:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-19 07:54:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2022-11-19 07:54:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 429 states have (on average 1.7412587412587412) internal successors, (747), 722 states have internal predecessors, (747), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:54:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 774 transitions. [2022-11-19 07:54:37,361 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 774 transitions. Word has length 66 [2022-11-19 07:54:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:37,361 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 774 transitions. [2022-11-19 07:54:37,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:54:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 774 transitions. [2022-11-19 07:54:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 07:54:37,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:37,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:37,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-19 07:54:37,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:37,577 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1543934731, now seen corresponding path program 1 times [2022-11-19 07:54:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:37,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699982661] [2022-11-19 07:54:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:37,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:37,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:37,581 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:37,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-19 07:54:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:37,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:54:37,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:37,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:38,009 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:38,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699982661] [2022-11-19 07:54:38,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699982661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:38,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [901932454] [2022-11-19 07:54:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:38,010 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:54:38,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:54:38,017 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:54:38,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-19 07:54:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:38,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:54:38,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:38,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:38,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [901932454] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:38,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594722894] [2022-11-19 07:54:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:38,546 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:38,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 07:54:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:38,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:54:38,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:38,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:38,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594722894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:38,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:54:38,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-19 07:54:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552493923] [2022-11-19 07:54:38,900 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:54:38,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:54:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:54:38,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:54:38,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:54:38,901 INFO L87 Difference]: Start difference. First operand 728 states and 774 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:54:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:39,099 INFO L93 Difference]: Finished difference Result 740 states and 791 transitions. [2022-11-19 07:54:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:54:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-19 07:54:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:39,103 INFO L225 Difference]: With dead ends: 740 [2022-11-19 07:54:39,104 INFO L226 Difference]: Without dead ends: 740 [2022-11-19 07:54:39,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:54:39,107 INFO L413 NwaCegarLoop]: 721 mSDtfsCounter, 17 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:39,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3587 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:54:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-19 07:54:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 738. [2022-11-19 07:54:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 438 states have (on average 1.7397260273972603) internal successors, (762), 731 states have internal predecessors, (762), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:54:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 789 transitions. [2022-11-19 07:54:39,125 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 789 transitions. Word has length 67 [2022-11-19 07:54:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:39,125 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 789 transitions. [2022-11-19 07:54:39,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:54:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 789 transitions. [2022-11-19 07:54:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 07:54:39,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:39,126 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:39,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:39,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:39,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:39,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:54:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1247879710, now seen corresponding path program 2 times [2022-11-19 07:54:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:54:39,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579235659] [2022-11-19 07:54:39,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:54:39,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:54:39,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:54:39,743 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:54:39,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-19 07:54:40,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:54:40,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:54:40,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:54:40,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:40,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:40,495 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:54:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579235659] [2022-11-19 07:54:40,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579235659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [962320547] [2022-11-19 07:54:40,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:54:40,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:54:40,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:54:40,497 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:54:40,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-19 07:54:41,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:54:41,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:54:41,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:54:41,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:41,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:41,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [962320547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:41,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316624458] [2022-11-19 07:54:41,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:54:41,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:41,766 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:41,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 07:55:04,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:55:04,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:55:04,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:55:04,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:04,756 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:55:04,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:55:04,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:55:05,329 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:55:05,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 07:55:05,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-19 07:55:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:55:05,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:05,657 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 07:55:05,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-19 07:55:05,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-19 07:55:05,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316624458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:05,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 07:55:05,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-19 07:55:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560114134] [2022-11-19 07:55:05,672 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 07:55:05,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 07:55:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:55:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 07:55:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-19 07:55:05,674 INFO L87 Difference]: Start difference. First operand 738 states and 789 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:55:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:19,198 INFO L93 Difference]: Finished difference Result 1066 states and 1147 transitions. [2022-11-19 07:55:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-19 07:55:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-11-19 07:55:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:19,201 INFO L225 Difference]: With dead ends: 1066 [2022-11-19 07:55:19,201 INFO L226 Difference]: Without dead ends: 1062 [2022-11-19 07:55:19,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=318, Invalid=1916, Unknown=26, NotChecked=92, Total=2352 [2022-11-19 07:55:19,202 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 824 mSDsluCounter, 7462 mSDsCounter, 0 mSdLazyCounter, 5624 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 8100 SdHoareTripleChecker+Invalid, 6218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:19,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 8100 Invalid, 6218 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 5624 Invalid, 0 Unknown, 558 Unchecked, 12.1s Time] [2022-11-19 07:55:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-19 07:55:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 742. [2022-11-19 07:55:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 443 states have (on average 1.7291196388261851) internal successors, (766), 735 states have internal predecessors, (766), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:55:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 793 transitions. [2022-11-19 07:55:19,219 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 793 transitions. Word has length 70 [2022-11-19 07:55:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:19,220 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 793 transitions. [2022-11-19 07:55:19,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:55:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 793 transitions. [2022-11-19 07:55:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-19 07:55:19,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:55:19,221 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:55:19,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:19,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:19,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:19,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:55:19,848 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:55:19,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:55:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2073813366, now seen corresponding path program 1 times [2022-11-19 07:55:19,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:55:19,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881591598] [2022-11-19 07:55:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:19,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:55:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:55:19,850 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:55:19,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-19 07:55:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:20,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 07:55:20,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:20,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:21,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:55:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881591598] [2022-11-19 07:55:21,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881591598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:55:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [462019310] [2022-11-19 07:55:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:55:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:55:21,072 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:55:21,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-19 07:55:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:21,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 07:55:21,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:21,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:22,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [462019310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:55:22,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154082852] [2022-11-19 07:55:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:22,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:22,056 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:22,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-19 07:55:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:22,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 07:55:22,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:22,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:23,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154082852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:55:23,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:55:23,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2022-11-19 07:55:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645770497] [2022-11-19 07:55:23,428 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:55:23,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 07:55:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:55:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 07:55:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 07:55:23,430 INFO L87 Difference]: Start difference. First operand 742 states and 793 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:55:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:26,716 INFO L93 Difference]: Finished difference Result 783 states and 850 transitions. [2022-11-19 07:55:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-19 07:55:26,717 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2022-11-19 07:55:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:26,720 INFO L225 Difference]: With dead ends: 783 [2022-11-19 07:55:26,721 INFO L226 Difference]: Without dead ends: 777 [2022-11-19 07:55:26,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2022-11-19 07:55:26,722 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 166 mSDsluCounter, 11515 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 12242 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:26,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 12242 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-19 07:55:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-11-19 07:55:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 761. [2022-11-19 07:55:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 462 states have (on average 1.7142857142857142) internal successors, (792), 754 states have internal predecessors, (792), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:55:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 819 transitions. [2022-11-19 07:55:26,737 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 819 transitions. Word has length 75 [2022-11-19 07:55:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:26,738 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 819 transitions. [2022-11-19 07:55:26,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:55:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 819 transitions. [2022-11-19 07:55:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-19 07:55:26,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:55:26,739 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:55:26,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:26,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:27,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:27,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:27,354 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:55:27,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:55:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1286334177, now seen corresponding path program 2 times [2022-11-19 07:55:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:55:27,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966846854] [2022-11-19 07:55:27,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:55:27,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:55:27,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:55:27,357 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:55:27,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-19 07:55:27,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:55:27,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:55:27,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 07:55:27,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:28,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:31,924 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:55:31,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966846854] [2022-11-19 07:55:31,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966846854] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:55:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70871956] [2022-11-19 07:55:31,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:55:31,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:55:31,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:55:31,932 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:55:31,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-19 07:55:33,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:55:33,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:55:33,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 07:55:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:33,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:34,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [70871956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:55:34,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791582120] [2022-11-19 07:55:34,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:55:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:34,720 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:34,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-19 07:55:45,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:55:45,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:55:45,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 07:55:45,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:45,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:55:45,673 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:55:45,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:55:45,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:55:45,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:55:46,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:55:46,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 07:55:46,467 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2317 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2317))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 07:55:46,793 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 07:55:46,810 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 07:55:46,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330)))) is different from true [2022-11-19 07:55:47,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 07:55:47,021 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2333)))) is different from true [2022-11-19 07:55:47,040 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336)))) is different from true [2022-11-19 07:55:47,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 07:55:47,794 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347)))) is different from true [2022-11-19 07:55:47,962 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2351))) (exists ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2352) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 07:55:47,983 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354))) (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 07:55:47,999 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2356))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2355) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 07:55:48,069 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:55:48,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 07:55:48,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 07:55:48,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 07:55:48,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 07:55:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 174 not checked. [2022-11-19 07:55:48,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:49,340 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-19 07:55:49,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791582120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:49,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 07:55:49,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 21] total 66 [2022-11-19 07:55:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034794994] [2022-11-19 07:55:49,349 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 07:55:49,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-19 07:55:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:55:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-19 07:55:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=2476, Unknown=33, NotChecked=1560, Total=4692 [2022-11-19 07:55:49,352 INFO L87 Difference]: Start difference. First operand 761 states and 819 transitions. Second operand has 66 states, 65 states have (on average 2.7846153846153845) internal successors, (181), 66 states have internal predecessors, (181), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:56:26,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_ArrVal_2356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2356))) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342))) (exists ((v_ArrVal_2319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2319))) (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354))) (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332))) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2355) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2351))) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2352) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2333))) (exists ((v_ArrVal_2320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2320))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347))) (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330)))) is different from true [2022-11-19 07:57:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:57:00,679 INFO L93 Difference]: Finished difference Result 1141 states and 1270 transitions. [2022-11-19 07:57:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-19 07:57:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.7846153846153845) internal successors, (181), 66 states have internal predecessors, (181), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2022-11-19 07:57:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:57:00,685 INFO L225 Difference]: With dead ends: 1141 [2022-11-19 07:57:00,685 INFO L226 Difference]: Without dead ends: 1133 [2022-11-19 07:57:00,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 351 SyntacticMatches, 14 SemanticMatches, 140 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 3224 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=2703, Invalid=13451, Unknown=158, NotChecked=3710, Total=20022 [2022-11-19 07:57:00,692 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 1152 mSDsluCounter, 16500 mSDsCounter, 0 mSdLazyCounter, 14797 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 17142 SdHoareTripleChecker+Invalid, 26504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 14797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11597 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:57:00,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 17142 Invalid, 26504 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [110 Valid, 14797 Invalid, 0 Unknown, 11597 Unchecked, 34.5s Time] [2022-11-19 07:57:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-11-19 07:57:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 792. [2022-11-19 07:57:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 494 states have (on average 1.6781376518218623) internal successors, (829), 785 states have internal predecessors, (829), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:57:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 856 transitions. [2022-11-19 07:57:00,713 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 856 transitions. Word has length 86 [2022-11-19 07:57:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:57:00,713 INFO L495 AbstractCegarLoop]: Abstraction has 792 states and 856 transitions. [2022-11-19 07:57:00,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.7846153846153845) internal successors, (181), 66 states have internal predecessors, (181), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:57:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 856 transitions. [2022-11-19 07:57:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-19 07:57:00,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:57:00,715 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:57:00,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-19 07:57:00,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-19 07:57:01,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-19 07:57:01,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:57:01,332 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:57:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:57:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1404058784, now seen corresponding path program 1 times [2022-11-19 07:57:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:57:01,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344114156] [2022-11-19 07:57:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:01,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:57:01,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:57:01,335 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:57:01,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-19 07:57:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:01,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 07:57:02,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:03,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:57:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:09,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:57:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344114156] [2022-11-19 07:57:09,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344114156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:57:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1549105916] [2022-11-19 07:57:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:57:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:57:09,788 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:57:09,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-19 07:57:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:10,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 07:57:10,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:11,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:57:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:12,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1549105916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:57:12,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756757993] [2022-11-19 07:57:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:57:12,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:57:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:57:12,236 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:57:12,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-19 07:57:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:57:12,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 07:57:12,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:57:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:13,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:57:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:57:24,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756757993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:57:24,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:57:24,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2022-11-19 07:57:24,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50054202] [2022-11-19 07:57:24,614 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:57:24,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-19 07:57:24,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:57:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-19 07:57:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2022-11-19 07:57:24,621 INFO L87 Difference]: Start difference. First operand 792 states and 856 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:58:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:58:41,939 INFO L93 Difference]: Finished difference Result 938 states and 1063 transitions. [2022-11-19 07:58:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-19 07:58:41,940 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 110 [2022-11-19 07:58:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:58:41,943 INFO L225 Difference]: With dead ends: 938 [2022-11-19 07:58:41,943 INFO L226 Difference]: Without dead ends: 932 [2022-11-19 07:58:41,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7404 ImplicationChecksByTransitivity, 77.1s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2022-11-19 07:58:41,953 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 1118 mSDsluCounter, 33050 mSDsCounter, 0 mSdLazyCounter, 6993 mSolverCounterSat, 1352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 33806 SdHoareTripleChecker+Invalid, 8345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1352 IncrementalHoareTripleChecker+Valid, 6993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:58:41,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 33806 Invalid, 8345 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1352 Valid, 6993 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2022-11-19 07:58:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-19 07:58:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 856. [2022-11-19 07:58:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 558 states have (on average 1.6379928315412187) internal successors, (914), 849 states have internal predecessors, (914), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:58:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 941 transitions. [2022-11-19 07:58:41,987 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 941 transitions. Word has length 110 [2022-11-19 07:58:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:58:41,988 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 941 transitions. [2022-11-19 07:58:41,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:58:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 941 transitions. [2022-11-19 07:58:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 07:58:41,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:58:41,990 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:58:42,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-19 07:58:42,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-19 07:58:42,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-19 07:58:42,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 07:58:42,614 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:58:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:58:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash 166055575, now seen corresponding path program 2 times [2022-11-19 07:58:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:58:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986406330] [2022-11-19 07:58:42,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:58:42,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:58:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:58:42,618 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:58:42,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-19 07:58:43,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:58:43,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:58:43,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 07:58:43,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:58:43,441 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 07:58:43,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-11-19 07:58:43,516 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-19 07:58:43,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-19 07:58:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-19 07:58:43,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:58:43,542 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:58:43,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986406330] [2022-11-19 07:58:43,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986406330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:58:43,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:58:43,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:58:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302180604] [2022-11-19 07:58:43,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:58:43,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:58:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:58:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:58:43,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:58:43,545 INFO L87 Difference]: Start difference. First operand 856 states and 941 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:58:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:58:47,140 INFO L93 Difference]: Finished difference Result 1146 states and 1244 transitions. [2022-11-19 07:58:47,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:58:47,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-11-19 07:58:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:58:47,145 INFO L225 Difference]: With dead ends: 1146 [2022-11-19 07:58:47,145 INFO L226 Difference]: Without dead ends: 1146 [2022-11-19 07:58:47,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:58:47,146 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 348 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:58:47,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 3039 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1131 Invalid, 0 Unknown, 526 Unchecked, 3.5s Time] [2022-11-19 07:58:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-11-19 07:58:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 855. [2022-11-19 07:58:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 558 states have (on average 1.636200716845878) internal successors, (913), 848 states have internal predecessors, (913), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 07:58:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 940 transitions. [2022-11-19 07:58:47,177 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 940 transitions. Word has length 113 [2022-11-19 07:58:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:58:47,178 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 940 transitions. [2022-11-19 07:58:47,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:58:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 940 transitions. [2022-11-19 07:58:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 07:58:47,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:58:47,179 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:58:47,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-19 07:58:47,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:58:47,399 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 07:58:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:58:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 166055576, now seen corresponding path program 1 times [2022-11-19 07:58:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:58:47,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074749458] [2022-11-19 07:58:47,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:58:47,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:58:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:58:47,402 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:58:47,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-19 07:58:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:58:48,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 07:58:48,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:58:48,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 07:58:48,616 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:58:48,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:58:48,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:58:48,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:58:48,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:58:48,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:58:48,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 07:58:48,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 07:58:48,913 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150)))) is different from true [2022-11-19 07:58:48,926 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152)))) is different from true [2022-11-19 07:58:48,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156)))) is different from true [2022-11-19 07:58:49,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176)))) is different from true [2022-11-19 07:58:49,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 07:58:49,364 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 07:58:49,458 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 07:58:49,473 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-11-19 07:58:49,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 07:58:49,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194)))) is different from true [2022-11-19 07:58:49,555 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 07:58:49,569 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200)))) is different from true [2022-11-19 07:58:49,695 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208)))) is different from true [2022-11-19 07:58:49,799 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215)))) is different from true [2022-11-19 07:58:49,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 07:58:49,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219)))) is different from true [2022-11-19 07:58:49,880 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223)))) is different from true [2022-11-19 07:58:49,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227)))) is different from true [2022-11-19 07:58:49,983 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231)))) is different from true [2022-11-19 07:58:50,074 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:58:50,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 07:58:50,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 07:58:50,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:58:50,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 07:58:50,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 07:58:50,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 07:58:50,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 07:58:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-11-19 07:58:50,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:58:50,512 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-19 07:58:50,561 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 07:58:51,757 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4326) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4327))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4326) .cse2 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 07:58:51,771 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:58:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074749458] [2022-11-19 07:58:51,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074749458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:58:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936474576] [2022-11-19 07:58:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:58:51,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:58:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:58:51,776 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:58:51,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-19 08:01:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:02,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-19 08:01:02,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:01:02,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:01:02,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:01:02,239 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:01:02,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:01:02,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:01:02,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:01:02,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 08:01:02,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:01:02,410 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693)))) is different from true [2022-11-19 08:01:02,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:02,438 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2022-11-19 08:01:02,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707)))) is different from true [2022-11-19 08:01:02,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709)))) is different from true [2022-11-19 08:01:02,667 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712)))) is different from true [2022-11-19 08:01:02,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:02,782 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:02,835 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:01:02,851 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:02,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728)))) is different from true [2022-11-19 08:01:02,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:02,943 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:03,039 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:03,055 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:01:03,109 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746)))) is different from true [2022-11-19 08:01:03,199 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-11-19 08:01:03,256 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:03,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:01:03,702 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:03,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:03,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:01:03,812 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:03,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:03,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:01:03,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 08:01:03,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 08:01:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 665 not checked. [2022-11-19 08:01:03,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:01:03,961 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:01:04,008 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:01:05,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4872))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4873) .cse0 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4873) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-19 08:01:05,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1936474576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:01:05,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177968084] [2022-11-19 08:01:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:05,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:01:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:01:05,081 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:01:05,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-19 08:01:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:05,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 08:01:05,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:01:05,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:01:05,955 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:01:05,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:01:05,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:01:05,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:01:06,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 08:01:06,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:01:06,126 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238)))) is different from true [2022-11-19 08:01:06,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248)))) is different from true [2022-11-19 08:01:06,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:01:06,643 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:01:06,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-19 08:01:06,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:06,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-19 08:01:06,956 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:01:06,969 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292)))) is different from true [2022-11-19 08:01:07,059 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297)))) is different from true [2022-11-19 08:01:07,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299)))) is different from true [2022-11-19 08:01:07,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:01:07,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-19 08:01:07,310 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:07,322 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:07,335 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-11-19 08:01:07,385 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:07,436 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:07,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:07,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:01:07,546 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:07,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:07,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:01:07,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 08:01:07,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 08:01:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 351 trivial. 612 not checked. [2022-11-19 08:01:07,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:01:07,682 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:01:07,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-19 08:01:08,768 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5417) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5418))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5417) .cse2 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:01:08,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177968084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:01:08,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:01:08,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 27] total 66 [2022-11-19 08:01:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057293999] [2022-11-19 08:01:08,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:01:08,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-19 08:01:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:01:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-19 08:01:08,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=184, Unknown=73, NotChecked=5590, Total=6006 [2022-11-19 08:01:08,783 INFO L87 Difference]: Start difference. First operand 855 states and 940 transitions. Second operand has 67 states, 65 states have (on average 2.8) internal successors, (182), 67 states have internal predecessors, (182), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 08:01:09,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238)))) is different from true [2022-11-19 08:01:09,417 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707))) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-19 08:01:09,435 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-19 08:01:09,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709))) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-19 08:01:09,477 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731))) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709))) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-19 08:01:09,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:01:17,697 INFO L93 Difference]: Finished difference Result 1159 states and 1259 transitions. [2022-11-19 08:01:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:01:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 2.8) internal successors, (182), 67 states have internal predecessors, (182), 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 113 [2022-11-19 08:01:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:01:17,703 INFO L225 Difference]: With dead ends: 1159 [2022-11-19 08:01:17,704 INFO L226 Difference]: Without dead ends: 1159 [2022-11-19 08:01:17,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 201 SyntacticMatches, 80 SemanticMatches, 91 ConstructedPredicates, 71 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=236, Invalid=422, Unknown=88, NotChecked=7810, Total=8556 [2022-11-19 08:01:17,705 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 782 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 61412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58626 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:01:17,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2681 Invalid, 61412 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 2776 Invalid, 0 Unknown, 58626 Unchecked, 8.2s Time] [2022-11-19 08:01:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-19 08:01:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 854. [2022-11-19 08:01:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 558 states have (on average 1.6344086021505377) internal successors, (912), 847 states have internal predecessors, (912), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:01:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 939 transitions. [2022-11-19 08:01:17,722 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 939 transitions. Word has length 113 [2022-11-19 08:01:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:01:17,722 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 939 transitions. [2022-11-19 08:01:17,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 2.8) internal successors, (182), 67 states have internal predecessors, (182), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 08:01:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 939 transitions. [2022-11-19 08:01:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-19 08:01:17,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:17,725 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:01:17,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-19 08:01:17,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-19 08:01:18,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-19 08:01:18,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:01:18,340 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 08:01:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash -840411099, now seen corresponding path program 1 times [2022-11-19 08:01:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:01:18,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955642951] [2022-11-19 08:01:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:18,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:01:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:01:18,343 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:01:18,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-19 08:01:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:19,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-19 08:01:19,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:01:19,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:01:19,844 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:01:19,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 08:01:19,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:01:20,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 08:01:20,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5796) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:20,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806)))) is different from true [2022-11-19 08:01:20,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:21,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:01:21,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829)))) is different from true [2022-11-19 08:01:21,480 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831)))) is different from true [2022-11-19 08:01:21,750 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838)))) is different from true [2022-11-19 08:01:21,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-11-19 08:01:21,857 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:21,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 08:01:22,015 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:22,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 08:01:22,134 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:22,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 08:01:22,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-19 08:01:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-19 08:01:22,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:01:22,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5841) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-19 08:01:22,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5841) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:01:22,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5840))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5841)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:01:22,359 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5840))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5841)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-19 08:01:22,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5887))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5840)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5841)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:01:22,759 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:01:22,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955642951] [2022-11-19 08:01:22,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955642951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:01:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [576472959] [2022-11-19 08:01:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:22,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:01:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:01:22,761 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:01:22,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-19 08:01:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:52,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-19 08:01:52,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:01:52,726 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 08:01:52,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 08:01:53,097 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-19 08:01:53,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-19 08:01:53,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:01:53,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:01:57,227 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:57,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:57,493 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:57,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:57,672 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:01:57,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:01:57,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-11-19 08:01:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-19 08:01:57,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:01:59,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-19 08:01:59,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6309))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6310)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:01:59,996 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6309))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6310)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:02:00,382 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6356))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6309)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6310)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:02:00,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [576472959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:02:00,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826404032] [2022-11-19 08:02:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:00,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:02:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:02:00,388 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:02:00,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-19 08:02:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:01,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 08:02:01,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:01,488 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:02:01,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:02:01,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:02:01,817 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6732))) is different from true [2022-11-19 08:02:01,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6733))) is different from true [2022-11-19 08:02:01,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6734) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,847 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6735) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,856 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6736))) is different from true [2022-11-19 08:02:01,868 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6737) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,876 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6738) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,885 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6739))) is different from true [2022-11-19 08:02:01,893 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6740))) is different from true [2022-11-19 08:02:01,901 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6741) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,909 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6742) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,917 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6743))) is different from true [2022-11-19 08:02:01,956 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6744) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,964 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6745) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,972 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6746) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:01,981 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6747))) is different from true [2022-11-19 08:02:01,989 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6748))) is different from true [2022-11-19 08:02:01,996 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6749) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,003 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6750))) is different from true [2022-11-19 08:02:02,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6751))) is different from true [2022-11-19 08:02:02,017 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6752))) is different from true [2022-11-19 08:02:02,023 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6753))) is different from true [2022-11-19 08:02:02,030 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754))) is different from true [2022-11-19 08:02:02,038 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) is different from true [2022-11-19 08:02:02,045 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,052 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6757) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,058 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6758))) is different from true [2022-11-19 08:02:02,065 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6759))) is different from true [2022-11-19 08:02:02,072 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6760) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,078 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761))) is different from true [2022-11-19 08:02:02,085 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6762))) is different from true [2022-11-19 08:02:02,092 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6763) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,099 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) is different from true [2022-11-19 08:02:02,106 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,113 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766))) is different from true [2022-11-19 08:02:02,119 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,126 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768))) is different from true [2022-11-19 08:02:02,133 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769))) is different from true [2022-11-19 08:02:02,140 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,147 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771))) is different from true [2022-11-19 08:02:02,154 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772))) is different from true [2022-11-19 08:02:02,161 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773))) is different from true [2022-11-19 08:02:02,168 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774))) is different from true [2022-11-19 08:02:02,174 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:02:02,205 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:02:02,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-19 08:02:02,321 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:02:02,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-19 08:02:02,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:02:02,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 08:02:02,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-19 08:02:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-19 08:02:02,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:02:02,577 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 08:02:02,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-19 08:02:02,751 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-19 08:02:02,768 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6776)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-19 08:02:02,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6776))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-19 08:02:03,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6823))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6776)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-19 08:02:03,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826404032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:02:03,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:02:03,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 55] total 81 [2022-11-19 08:02:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858253336] [2022-11-19 08:02:03,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:02:03,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-19 08:02:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-19 08:02:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=918, Unknown=117, NotChecked=8190, Total=9506 [2022-11-19 08:02:03,158 INFO L87 Difference]: Start difference. First operand 854 states and 939 transitions. Second operand has 82 states, 78 states have (on average 3.141025641025641) internal successors, (245), 82 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 08:02:15,956 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_6732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6732))) (exists ((v_ArrVal_5796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5796) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:15,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_6733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6733)))) is different from true [2022-11-19 08:02:15,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6734) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:15,998 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_6735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,015 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6736))) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,039 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6737) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6738) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6739))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,058 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6740))) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6741) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6742) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,114 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6743))) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,147 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,171 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_6746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,189 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6747))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,196 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6748))) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_6750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6750))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,238 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6751))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_6752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6752))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_6753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6753))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,306 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:16,521 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_56) (_ bv1 1))) (not (= v_arrayElimCell_56 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797)))) is different from true [2022-11-19 08:02:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:17,845 INFO L93 Difference]: Finished difference Result 2082 states and 2248 transitions. [2022-11-19 08:02:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-19 08:02:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 78 states have (on average 3.141025641025641) internal successors, (245), 82 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 116 [2022-11-19 08:02:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:17,855 INFO L225 Difference]: With dead ends: 2082 [2022-11-19 08:02:17,855 INFO L226 Difference]: Without dead ends: 2082 [2022-11-19 08:02:17,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 199 SyntacticMatches, 84 SemanticMatches, 137 ConstructedPredicates, 91 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=496, Invalid=1960, Unknown=164, NotChecked=16562, Total=19182 [2022-11-19 08:02:17,857 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 2646 mSDsluCounter, 4595 mSDsCounter, 0 mSdLazyCounter, 4487 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2672 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 72939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68362 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:17,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2672 Valid, 5075 Invalid, 72939 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [90 Valid, 4487 Invalid, 0 Unknown, 68362 Unchecked, 12.9s Time] [2022-11-19 08:02:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-11-19 08:02:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 853. [2022-11-19 08:02:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 558 states have (on average 1.6326164874551972) internal successors, (911), 846 states have internal predecessors, (911), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:02:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 938 transitions. [2022-11-19 08:02:17,878 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 938 transitions. Word has length 116 [2022-11-19 08:02:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:17,879 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 938 transitions. [2022-11-19 08:02:17,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 78 states have (on average 3.141025641025641) internal successors, (245), 82 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 08:02:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 938 transitions. [2022-11-19 08:02:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-19 08:02:17,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:17,881 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:17,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:18,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:18,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:18,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:02:18,500 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-11-19 08:02:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash -840411098, now seen corresponding path program 1 times [2022-11-19 08:02:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:18,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075416534] [2022-11-19 08:02:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:18,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:18,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:18,502 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:18,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-19 08:02:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:19,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-19 08:02:19,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:19,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:02:20,046 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:02:20,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:02:20,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:02:20,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:02:20,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:02:20,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 08:02:20,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:02:20,388 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7203))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7204)))) is different from true [2022-11-19 08:02:20,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213)))) is different from true [2022-11-19 08:02:20,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,586 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:02:20,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,616 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222)))) is different from true [2022-11-19 08:02:20,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,670 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-19 08:02:20,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:20,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232))) (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,721 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7234))) (exists ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7233) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,739 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:20,756 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7238) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7237))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,774 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:02:20,804 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,819 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7246))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7245)))) is different from true [2022-11-19 08:02:20,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249)))) is different from true [2022-11-19 08:02:20,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7252) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7251))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,887 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253)))) is different from true [2022-11-19 08:02:20,904 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256))) (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7258))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7257)))) is different from true [2022-11-19 08:02:20,935 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7259))) (exists ((v_ArrVal_7260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7260) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:20,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7262) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:02:20,982 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:20,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265))) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:21,012 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7267) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7268)))) is different from true [2022-11-19 08:02:21,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269)))) is different from true [2022-11-19 08:02:21,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7271))) (exists ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7272))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:21,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274))) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:21,087 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7275))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7276) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:02:21,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278))) (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:21,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7280) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7279)))) is different from true [2022-11-19 08:02:21,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281)))) is different from true [2022-11-19 08:02:21,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7284))) (exists ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7283)))) is different from true [2022-11-19 08:02:21,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7285))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7286)))) is different from true [2022-11-19 08:02:21,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:02:21,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7289) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7290) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:02:21,284 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:02:21,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:02:21,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:02:21,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:02:21,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:02:21,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:02:21,638 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:02:21,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:02:21,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:02:21,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 08:02:21,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 08:02:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-11-19 08:02:21,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:02:22,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-19 08:02:22,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-19 08:02:22,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7292) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7291))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7292) .cse2 v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:02:22,323 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7292) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7291))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7292) .cse3 v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-19 08:02:25,412 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7385))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7386) .cse1 v_ArrVal_7292) (select (select (store .cse2 .cse1 v_ArrVal_7291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7385))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7291))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7386) .cse4 v_ArrVal_7292) .cse5 v_ArrVal_7293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-19 08:02:25,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075416534] [2022-11-19 08:02:25,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075416534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:02:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547902853] [2022-11-19 08:02:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:02:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:02:25,429 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:02:25,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-19 08:07:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:07:47,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-19 08:07:47,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:07:47,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:07:48,237 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:07:48,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:07:48,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:07:48,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:07:48,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:07:48,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 08:07:48,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:07:48,554 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768)))) is different from true [2022-11-19 08:07:48,581 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:07:48,616 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:48,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:48,670 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:07:48,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778)))) is different from true [2022-11-19 08:07:48,739 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:48,772 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781)))) is different from true [2022-11-19 08:07:48,805 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:48,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:07:48,872 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788)))) is different from true [2022-11-19 08:07:48,904 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790)))) is different from true [2022-11-19 08:07:48,936 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792)))) is different from true [2022-11-19 08:07:48,969 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:48,999 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796)))) is different from true [2022-11-19 08:07:49,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,077 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,104 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,133 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804)))) is different from true [2022-11-19 08:07:49,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:49,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808)))) is different from true [2022-11-19 08:07:49,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810)))) is different from true [2022-11-19 08:07:49,261 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811)))) is different from true [2022-11-19 08:07:49,288 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814)))) is different from true [2022-11-19 08:07:49,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816)))) is different from true [2022-11-19 08:07:49,340 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818)))) is different from true [2022-11-19 08:07:49,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7822))) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,420 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7823))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7825) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7826) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,475 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7828))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7827) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:49,508 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7829))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:07:49,535 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7831))) (exists ((v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7832))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,564 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7833))) (exists ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7834)))) is different from true [2022-11-19 08:07:49,592 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7836) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7835) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:49,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7838))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7837)))) is different from true [2022-11-19 08:07:49,646 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840))) (exists ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7839)))) is different from true [2022-11-19 08:07:49,675 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841)))) is different from true [2022-11-19 08:07:49,702 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,730 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,757 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7848))) (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,788 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7850))) (exists ((v_ArrVal_7849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7849) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,816 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7852) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7851)))) is different from true [2022-11-19 08:07:49,843 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7853) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:49,950 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:07:49,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:07:49,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:07:50,162 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:07:50,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:07:50,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:07:50,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:07:50,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:07:50,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:07:50,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 08:07:50,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 08:07:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-19 08:07:50,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:07:50,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2022-11-19 08:07:50,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:07:50,744 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7856) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7855) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7855))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7856) .cse2 v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:07:50,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7856) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7855) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7855))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7856) .cse3 v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-19 08:07:53,253 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7950))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7855))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7949) .cse0 v_ArrVal_7856) .cse1 v_ArrVal_7858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7950))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7949) .cse6 v_ArrVal_7856) (select (select (store .cse7 .cse6 v_ArrVal_7855) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7858))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-19 08:07:53,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1547902853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:07:53,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560090332] [2022-11-19 08:07:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:07:53,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:07:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:07:53,274 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:07:53,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cdf8bd-254e-4058-b833-bd16cee91f64/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-19 08:07:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:07:54,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-19 08:07:54,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:07:54,706 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:07:54,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:07:54,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:07:54,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:07:54,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:07:54,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 08:07:54,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:07:55,040 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329)))) is different from true [2022-11-19 08:07:55,068 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8334 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8334))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333)))) is different from true [2022-11-19 08:07:55,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338)))) is different from true [2022-11-19 08:07:55,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,204 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8341))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8342)))) is different from true [2022-11-19 08:07:55,232 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8343))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8344)))) is different from true [2022-11-19 08:07:55,259 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,315 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349)))) is different from true [2022-11-19 08:07:55,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8351))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352)))) is different from true [2022-11-19 08:07:55,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353)))) is different from true [2022-11-19 08:07:55,399 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360)))) is different from true [2022-11-19 08:07:55,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,510 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365)))) is different from true [2022-11-19 08:07:55,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:55,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371)))) is different from true [2022-11-19 08:07:55,649 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,724 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8378) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,757 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381)))) is different from true [2022-11-19 08:07:55,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383)))) is different from true [2022-11-19 08:07:55,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8385))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,894 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:55,925 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389))) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:55,974 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:56,009 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:56,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:56,064 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8398) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:07:56,092 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399)))) is different from true [2022-11-19 08:07:56,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8402))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:56,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8403) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8404)))) is different from true [2022-11-19 08:07:56,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406))) (exists ((v_ArrVal_8405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8405) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:07:56,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407)))) is different from true [2022-11-19 08:07:56,248 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32)))) is different from true [2022-11-19 08:07:56,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412)))) is different from true [2022-11-19 08:07:56,302 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414)))) is different from true [2022-11-19 08:07:56,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416)))) is different from true [2022-11-19 08:07:56,440 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:07:56,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:07:56,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:07:56,609 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:07:56,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:07:56,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:07:56,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:07:56,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:07:56,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:07:56,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 08:07:56,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 08:07:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-19 08:07:56,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:07:56,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8419) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:07:57,031 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8419) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:07:57,131 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8417))) (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~mem35#1.base| v_ArrVal_8418) .cse0 v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8419) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8418) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-19 08:07:57,322 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8418) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8417))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8418) .cse3 v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8419) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-19 08:07:59,119 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8511 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8511))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8417))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8512) .cse0 v_ArrVal_8418) .cse1 v_ArrVal_8420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8419) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8511 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8511))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8512) .cse6 v_ArrVal_8418) (select (select (store .cse7 .cse6 v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8420))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-19 08:07:59,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560090332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:07:59,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:07:59,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 53, 54] total 140 [2022-11-19 08:07:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979064744] [2022-11-19 08:07:59,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:07:59,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2022-11-19 08:07:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:07:59,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2022-11-19 08:07:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=284, Unknown=153, NotChecked=24048, Total=24806 [2022-11-19 08:07:59,147 INFO L87 Difference]: Start difference. First operand 853 states and 938 transitions. Second operand has 141 states, 139 states have (on average 1.6618705035971224) internal successors, (231), 141 states have internal predecessors, (231), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 08:08:00,545 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7203))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7204))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768)))) is different from true [2022-11-19 08:08:00,553 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331))) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206)))) is different from true [2022-11-19 08:08:00,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8334 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8334))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206)))) is different from true [2022-11-19 08:08:00,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206)))) is different from true [2022-11-19 08:08:00,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:00,622 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8341))) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_8342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8342))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:00,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8343))) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_8344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8344))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:00,643 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:00,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:00,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_ArrVal_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:00,677 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232))) (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231))) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_ArrVal_8351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8351))) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230))) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789))) (exists ((v_arrayElimCell_80 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_80) (_ bv44 32))) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:08:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:08:14,878 INFO L93 Difference]: Finished difference Result 867 states and 959 transitions. [2022-11-19 08:08:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 08:08:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 139 states have (on average 1.6618705035971224) internal successors, (231), 141 states have internal predecessors, (231), 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 116 [2022-11-19 08:08:14,881 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-19 08:08:14,882 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 139 states have (on average 1.6618705035971224) internal successors, (231), 141 states have internal predecessors, (231), 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 116