./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.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_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- 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-18 20:55:05,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:55:05,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:55:05,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:55:05,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:55:05,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:55:05,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:55:05,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:55:05,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:55:05,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:55:05,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:55:05,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:55:05,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:55:05,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:55:05,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:55:05,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:55:05,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:55:05,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:55:05,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:55:05,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:55:05,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:55:05,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:55:05,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:55:05,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:55:05,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:55:05,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:55:05,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:55:05,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:55:05,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:55:05,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:55:05,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:55:05,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:55:05,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:55:05,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:55:05,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:55:05,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:55:05,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:55:05,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:55:05,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:55:05,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:55:05,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:55:05,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:55:05,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:55:05,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:55:05,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:55:05,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:55:05,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:55:05,608 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:55:05,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:55:05,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:55:05,609 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:55:05,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:55:05,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:55:05,611 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:55:05,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:55:05,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:55:05,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:55:05,612 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:55:05,613 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:55:05,613 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:55:05,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:55:05,613 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:55:05,614 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:55:05,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:55:05,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:55:05,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:55:05,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:55:05,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:55:05,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:55:05,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:55:05,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:55:05,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:55:05,618 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_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/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_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2022-11-18 20:55:05,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:55:05,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:55:05,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:55:05,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:55:05,935 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:55:05,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2022-11-18 20:55:06,017 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/380f5f52a/22a6d8cd2e544b9f85319071c0474b41/FLAGd6dd1f40c [2022-11-18 20:55:06,689 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:55:06,689 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2022-11-18 20:55:06,725 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/380f5f52a/22a6d8cd2e544b9f85319071c0474b41/FLAGd6dd1f40c [2022-11-18 20:55:06,850 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/380f5f52a/22a6d8cd2e544b9f85319071c0474b41 [2022-11-18 20:55:06,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:55:06,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:55:06,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:55:06,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:55:06,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:55:06,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:55:06" (1/1) ... [2022-11-18 20:55:06,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cab23c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:06, skipping insertion in model container [2022-11-18 20:55:06,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:55:06" (1/1) ... [2022-11-18 20:55:06,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:55:06,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:55:07,451 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[33021,33034] [2022-11-18 20:55:07,618 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[49681,49694] [2022-11-18 20:55:07,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:55:07,659 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-18 20:55:07,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c343ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:07, skipping insertion in model container [2022-11-18 20:55:07,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:55:07,660 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-18 20:55:07,662 INFO L158 Benchmark]: Toolchain (without parser) took 806.82ms. Allocated memory is still 111.1MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: -30.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:55:07,663 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:55:07,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.63ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 73.1MB in the end (delta: -145.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:55:07,665 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.32ms. Allocated memory is still 111.1MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.63ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 73.1MB in the end (delta: -145.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- 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-18 20:55:09,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:55:09,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:55:09,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:55:09,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:55:09,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:55:09,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:55:09,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:55:09,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:55:09,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:55:09,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:55:09,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:55:09,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:55:09,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:55:09,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:55:09,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:55:09,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:55:09,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:55:09,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:55:09,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:55:09,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:55:09,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:55:09,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:55:09,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:55:09,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:55:09,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:55:09,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:55:09,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:55:09,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:55:09,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:55:09,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:55:09,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:55:09,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:55:09,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:55:09,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:55:09,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:55:09,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:55:09,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:55:09,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:55:09,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:55:10,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:55:10,001 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 20:55:10,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:55:10,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:55:10,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:55:10,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:55:10,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:55:10,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:55:10,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:55:10,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:55:10,045 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:55:10,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:55:10,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:55:10,047 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:55:10,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:55:10,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:55:10,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:55:10,048 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:55:10,048 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:55:10,048 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:55:10,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:55:10,049 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:55:10,049 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:55:10,049 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:55:10,050 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:55:10,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:55:10,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:55:10,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:55:10,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:55:10,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:55:10,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:55:10,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:55:10,052 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:55:10,052 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:55:10,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:55:10,053 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_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/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_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2022-11-18 20:55:10,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:55:10,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:55:10,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:55:10,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:55:10,533 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:55:10,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2022-11-18 20:55:10,623 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/0dfe3177e/e6a709f832334ac192cc464ff53050de/FLAG5c7fce143 [2022-11-18 20:55:11,382 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:55:11,383 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2022-11-18 20:55:11,406 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/0dfe3177e/e6a709f832334ac192cc464ff53050de/FLAG5c7fce143 [2022-11-18 20:55:11,552 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/data/0dfe3177e/e6a709f832334ac192cc464ff53050de [2022-11-18 20:55:11,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:55:11,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:55:11,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:55:11,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:55:11,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:55:11,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:55:11" (1/1) ... [2022-11-18 20:55:11,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3e2ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:11, skipping insertion in model container [2022-11-18 20:55:11,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:55:11" (1/1) ... [2022-11-18 20:55:11,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:55:11,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:55:12,252 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[33021,33034] [2022-11-18 20:55:12,495 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[49681,49694] [2022-11-18 20:55:12,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:55:12,556 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:55:12,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:55:12,590 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[33021,33034] [2022-11-18 20:55:12,673 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[49681,49694] [2022-11-18 20:55:12,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:55:12,691 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:55:12,716 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[33021,33034] [2022-11-18 20:55:12,798 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_d01794d1-373f-4891-af68-ba210202cc37/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i[49681,49694] [2022-11-18 20:55:12,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:55:12,886 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:55:12,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12 WrapperNode [2022-11-18 20:55:12,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:55:12,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:55:12,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:55:12,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:55:12,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:12,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,097 INFO L138 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1713 [2022-11-18 20:55:13,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:55:13,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:55:13,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:55:13,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:55:13,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:55:13,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:55:13,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:55:13,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:55:13,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (1/1) ... [2022-11-18 20:55:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:55:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:55:13,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:55:13,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:55:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-18 20:55:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 20:55:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:55:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:55:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-18 20:55:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-18 20:55:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:55:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:55:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:55:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:55:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-18 20:55:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:55:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:55:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:55:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:55:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:55:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:55:13,729 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:55:13,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:55:13,751 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-18 20:55:22,731 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:55:22,772 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:55:22,772 INFO L300 CfgBuilder]: Removed 100 assume(true) statements. [2022-11-18 20:55:22,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:22 BoogieIcfgContainer [2022-11-18 20:55:22,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:55:22,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:55:22,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:55:22,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:55:22,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:55:11" (1/3) ... [2022-11-18 20:55:22,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbe9c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:55:22, skipping insertion in model container [2022-11-18 20:55:22,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:12" (2/3) ... [2022-11-18 20:55:22,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbe9c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:55:22, skipping insertion in model container [2022-11-18 20:55:22,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:22" (3/3) ... [2022-11-18 20:55:22,793 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-3.i [2022-11-18 20:55:22,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:55:22,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-11-18 20:55:22,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:55:22,924 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;@5990ef63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:55:22,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-11-18 20:55:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 1831 states, 891 states have (on average 2.2648709315375983) internal successors, (2018), 1822 states have internal predecessors, (2018), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:55:22,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:22,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:55:22,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-18 20:55:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:22,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728752298] [2022-11-18 20:55:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:22,973 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-18 20:55:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:22,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:22,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:23,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:55:23,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:23,311 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-18 20:55:23,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:23,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:23,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728752298] [2022-11-18 20:55:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728752298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:23,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:23,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:55:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851749682] [2022-11-18 20:55:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:23,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:55:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:55:23,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:55:23,393 INFO L87 Difference]: Start difference. First operand has 1831 states, 891 states have (on average 2.2648709315375983) internal successors, (2018), 1822 states have internal predecessors, (2018), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:55:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:23,535 INFO L93 Difference]: Finished difference Result 1813 states and 1913 transitions. [2022-11-18 20:55:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:55:23,539 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-18 20:55:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:23,573 INFO L225 Difference]: With dead ends: 1813 [2022-11-18 20:55:23,573 INFO L226 Difference]: Without dead ends: 1811 [2022-11-18 20:55:23,576 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-18 20:55:23,581 INFO L413 NwaCegarLoop]: 1913 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, 1913 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-18 20:55:23,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-11-18 20:55:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-11-18 20:55:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 882 states have (on average 2.1417233560090705) internal successors, (1889), 1802 states have internal predecessors, (1889), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1911 transitions. [2022-11-18 20:55:23,736 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1911 transitions. Word has length 5 [2022-11-18 20:55:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:23,736 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 1911 transitions. [2022-11-18 20:55:23,736 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-18 20:55:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1911 transitions. [2022-11-18 20:55:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:55:23,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:23,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:55:23,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:23,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:23,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-18 20:55:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:23,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253323959] [2022-11-18 20:55:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:23,958 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-18 20:55:23,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:23,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:23,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:24,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:55:24,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:24,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-18 20:55:24,227 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-18 20:55:24,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:24,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253323959] [2022-11-18 20:55:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253323959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:55:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966081146] [2022-11-18 20:55:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:24,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:24,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:55:24,231 INFO L87 Difference]: Start difference. First operand 1811 states and 1911 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-18 20:55:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:28,610 INFO L93 Difference]: Finished difference Result 2067 states and 2210 transitions. [2022-11-18 20:55:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:28,610 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-18 20:55:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:28,621 INFO L225 Difference]: With dead ends: 2067 [2022-11-18 20:55:28,621 INFO L226 Difference]: Without dead ends: 2067 [2022-11-18 20:55:28,621 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-18 20:55:28,623 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 1365 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:28,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1805 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-18 20:55:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-11-18 20:55:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1796. [2022-11-18 20:55:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 958 states have (on average 2.0177453027139873) internal successors, (1933), 1787 states have internal predecessors, (1933), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 1955 transitions. [2022-11-18 20:55:28,684 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 1955 transitions. Word has length 5 [2022-11-18 20:55:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:28,684 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 1955 transitions. [2022-11-18 20:55:28,684 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-18 20:55:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 1955 transitions. [2022-11-18 20:55:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:55:28,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:28,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:55:28,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:28,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:28,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-18 20:55:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:28,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362901629] [2022-11-18 20:55:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:28,897 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-18 20:55:28,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:28,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:28,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:29,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:55:29,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:29,134 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-18 20:55:29,166 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-18 20:55:29,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:29,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:29,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362901629] [2022-11-18 20:55:29,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362901629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:29,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:29,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:55:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161427016] [2022-11-18 20:55:29,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:29,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:55:29,173 INFO L87 Difference]: Start difference. First operand 1796 states and 1955 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-18 20:55:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:34,997 INFO L93 Difference]: Finished difference Result 2316 states and 2525 transitions. [2022-11-18 20:55:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:34,998 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-18 20:55:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:35,009 INFO L225 Difference]: With dead ends: 2316 [2022-11-18 20:55:35,009 INFO L226 Difference]: Without dead ends: 2316 [2022-11-18 20:55:35,010 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-18 20:55:35,014 INFO L413 NwaCegarLoop]: 1742 mSDtfsCounter, 741 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:35,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2540 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-18 20:55:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-11-18 20:55:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1952. [2022-11-18 20:55:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1124 states have (on average 1.9919928825622777) internal successors, (2239), 1943 states have internal predecessors, (2239), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2261 transitions. [2022-11-18 20:55:35,092 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2261 transitions. Word has length 5 [2022-11-18 20:55:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:35,092 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 2261 transitions. [2022-11-18 20:55:35,092 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-18 20:55:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2261 transitions. [2022-11-18 20:55:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:55:35,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:35,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:55:35,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:35,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:35,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-18 20:55:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:35,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590901120] [2022-11-18 20:55:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:35,308 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-18 20:55:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:35,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:35,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:35,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:55:35,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:35,510 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-18 20:55:35,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:35,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:35,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590901120] [2022-11-18 20:55:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590901120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:35,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000858401] [2022-11-18 20:55:35,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:35,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:55:35,524 INFO L87 Difference]: Start difference. First operand 1952 states and 2261 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-18 20:55:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:35,732 INFO L93 Difference]: Finished difference Result 3510 states and 4109 transitions. [2022-11-18 20:55:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:35,736 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-18 20:55:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:35,748 INFO L225 Difference]: With dead ends: 3510 [2022-11-18 20:55:35,748 INFO L226 Difference]: Without dead ends: 3510 [2022-11-18 20:55:35,748 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-18 20:55:35,750 INFO L413 NwaCegarLoop]: 2310 mSDtfsCounter, 1373 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 4110 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:35,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 4110 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:55:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2022-11-18 20:55:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 1954. [2022-11-18 20:55:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.9902309058614565) internal successors, (2241), 1945 states have internal predecessors, (2241), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2263 transitions. [2022-11-18 20:55:35,834 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2263 transitions. Word has length 6 [2022-11-18 20:55:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:35,835 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2263 transitions. [2022-11-18 20:55:35,835 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-18 20:55:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2263 transitions. [2022-11-18 20:55:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:55:35,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:35,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:55:35,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-18 20:55:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:36,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644228642] [2022-11-18 20:55:36,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:36,058 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-18 20:55:36,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:36,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:36,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:55:36,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:36,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:36,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644228642] [2022-11-18 20:55:36,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644228642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:36,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:36,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419997467] [2022-11-18 20:55:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:36,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:55:36,316 INFO L87 Difference]: Start difference. First operand 1954 states and 2263 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-18 20:55:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:36,375 INFO L93 Difference]: Finished difference Result 1918 states and 2226 transitions. [2022-11-18 20:55:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:36,376 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-18 20:55:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:36,383 INFO L225 Difference]: With dead ends: 1918 [2022-11-18 20:55:36,383 INFO L226 Difference]: Without dead ends: 1918 [2022-11-18 20:55:36,383 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-18 20:55:36,384 INFO L413 NwaCegarLoop]: 1762 mSDtfsCounter, 1732 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1790 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-18 20:55:36,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1790 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:55:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-11-18 20:55:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1912. [2022-11-18 20:55:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1108 states have (on average 1.983754512635379) internal successors, (2198), 1903 states have internal predecessors, (2198), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2220 transitions. [2022-11-18 20:55:36,428 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2220 transitions. Word has length 11 [2022-11-18 20:55:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:36,428 INFO L495 AbstractCegarLoop]: Abstraction has 1912 states and 2220 transitions. [2022-11-18 20:55:36,428 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-18 20:55:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2220 transitions. [2022-11-18 20:55:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:55:36,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:36,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:55:36,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-18 20:55:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:36,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994806406] [2022-11-18 20:55:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:36,643 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-18 20:55:36,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:36,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:36,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:55:36,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:36,898 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-18 20:55:36,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:36,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994806406] [2022-11-18 20:55:36,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994806406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:36,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:36,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:55:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3101231] [2022-11-18 20:55:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:36,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:55:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:55:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:55:36,901 INFO L87 Difference]: Start difference. First operand 1912 states and 2220 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-18 20:55:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:37,026 INFO L93 Difference]: Finished difference Result 1897 states and 2198 transitions. [2022-11-18 20:55:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:55:37,027 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-18 20:55:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:37,034 INFO L225 Difference]: With dead ends: 1897 [2022-11-18 20:55:37,034 INFO L226 Difference]: Without dead ends: 1897 [2022-11-18 20:55:37,034 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-18 20:55:37,035 INFO L413 NwaCegarLoop]: 1717 mSDtfsCounter, 1713 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 3455 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-18 20:55:37,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 3455 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:55:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-11-18 20:55:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1890. [2022-11-18 20:55:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1100 states have (on average 1.971818181818182) internal successors, (2169), 1881 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2191 transitions. [2022-11-18 20:55:37,074 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2191 transitions. Word has length 13 [2022-11-18 20:55:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:37,075 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 2191 transitions. [2022-11-18 20:55:37,075 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-18 20:55:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2191 transitions. [2022-11-18 20:55:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 20:55:37,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:37,076 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-18 20:55:37,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:37,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:37,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-18 20:55:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:37,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838899082] [2022-11-18 20:55:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:37,292 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-18 20:55:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:37,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:37,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:55:37,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:37,540 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-18 20:55:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:55:37,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:37,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:37,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838899082] [2022-11-18 20:55:37,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838899082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:37,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:37,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876943609] [2022-11-18 20:55:37,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:37,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:55:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:37,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:55:37,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:55:37,659 INFO L87 Difference]: Start difference. First operand 1890 states and 2191 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-18 20:55:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:44,119 INFO L93 Difference]: Finished difference Result 3103 states and 3449 transitions. [2022-11-18 20:55:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:55:44,120 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-18 20:55:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:44,129 INFO L225 Difference]: With dead ends: 3103 [2022-11-18 20:55:44,130 INFO L226 Difference]: Without dead ends: 3103 [2022-11-18 20:55:44,130 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-18 20:55:44,131 INFO L413 NwaCegarLoop]: 1067 mSDtfsCounter, 3372 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:44,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 2416 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-18 20:55:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2022-11-18 20:55:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 1886. [2022-11-18 20:55:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1100 states have (on average 1.9681818181818183) internal successors, (2165), 1877 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2187 transitions. [2022-11-18 20:55:44,177 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2187 transitions. Word has length 27 [2022-11-18 20:55:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:44,177 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 2187 transitions. [2022-11-18 20:55:44,177 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-18 20:55:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2187 transitions. [2022-11-18 20:55:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 20:55:44,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:44,178 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-18 20:55:44,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-18 20:55:44,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:44,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-18 20:55:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:44,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175858021] [2022-11-18 20:55:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:44,393 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-18 20:55:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:44,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:44,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:44,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:55:44,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:44,672 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-18 20:55:44,898 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-18 20:55:44,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:44,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175858021] [2022-11-18 20:55:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175858021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:44,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790636063] [2022-11-18 20:55:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:44,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:55:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:44,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:55:44,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:55:44,900 INFO L87 Difference]: Start difference. First operand 1886 states and 2187 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-18 20:55:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:52,984 INFO L93 Difference]: Finished difference Result 2632 states and 2851 transitions. [2022-11-18 20:55:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:55:52,987 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-18 20:55:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:52,995 INFO L225 Difference]: With dead ends: 2632 [2022-11-18 20:55:52,996 INFO L226 Difference]: Without dead ends: 2632 [2022-11-18 20:55:52,996 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-18 20:55:52,997 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 1687 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:52,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2873 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-18 20:55:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2022-11-18 20:55:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 1882. [2022-11-18 20:55:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1100 states have (on average 1.9645454545454546) internal successors, (2161), 1873 states have internal predecessors, (2161), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2183 transitions. [2022-11-18 20:55:53,042 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2183 transitions. Word has length 27 [2022-11-18 20:55:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:53,043 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2183 transitions. [2022-11-18 20:55:53,043 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-18 20:55:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2183 transitions. [2022-11-18 20:55:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:55:53,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:53,045 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-18 20:55:53,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:53,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:53,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-18 20:55:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:53,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360190816] [2022-11-18 20:55:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:53,261 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-18 20:55:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:53,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:53,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:53,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:55:53,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:53,665 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-18 20:55:53,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:53,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:53,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360190816] [2022-11-18 20:55:53,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360190816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:53,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:53,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:55:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600631345] [2022-11-18 20:55:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:53,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:55:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:55:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:55:53,669 INFO L87 Difference]: Start difference. First operand 1882 states and 2183 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-18 20:55:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:53,756 INFO L93 Difference]: Finished difference Result 1882 states and 2179 transitions. [2022-11-18 20:55:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:55:53,757 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-18 20:55:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:53,764 INFO L225 Difference]: With dead ends: 1882 [2022-11-18 20:55:53,764 INFO L226 Difference]: Without dead ends: 1882 [2022-11-18 20:55:53,765 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-18 20:55:53,768 INFO L413 NwaCegarLoop]: 1711 mSDtfsCounter, 1682 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3433 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:53,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3433 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:55:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-11-18 20:55:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1876. [2022-11-18 20:55:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1094 states have (on average 1.9661791590493602) internal successors, (2151), 1867 states have internal predecessors, (2151), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2173 transitions. [2022-11-18 20:55:53,811 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2173 transitions. Word has length 42 [2022-11-18 20:55:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:53,815 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2173 transitions. [2022-11-18 20:55:53,815 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-18 20:55:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2173 transitions. [2022-11-18 20:55:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:55:53,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:53,820 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-18 20:55:53,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:54,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:54,041 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-18 20:55:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:54,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339185593] [2022-11-18 20:55:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:54,049 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-18 20:55:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:54,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:54,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:54,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:55:54,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:54,686 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-18 20:55:54,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:54,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339185593] [2022-11-18 20:55:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339185593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:54,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:54,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:54,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931248553] [2022-11-18 20:55:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:54,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:55:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:54,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:55:54,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:55:54,688 INFO L87 Difference]: Start difference. First operand 1876 states and 2173 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-18 20:55:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:55:54,995 INFO L93 Difference]: Finished difference Result 2295 states and 2609 transitions. [2022-11-18 20:55:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:55:54,997 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-18 20:55:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:55:55,003 INFO L225 Difference]: With dead ends: 2295 [2022-11-18 20:55:55,003 INFO L226 Difference]: Without dead ends: 2295 [2022-11-18 20:55:55,003 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-18 20:55:55,004 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 455 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:55:55,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3374 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:55:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2022-11-18 20:55:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1922. [2022-11-18 20:55:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1140 states have (on average 1.9271929824561405) internal successors, (2197), 1913 states have internal predecessors, (2197), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:55:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2219 transitions. [2022-11-18 20:55:55,045 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2219 transitions. Word has length 50 [2022-11-18 20:55:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:55:55,046 INFO L495 AbstractCegarLoop]: Abstraction has 1922 states and 2219 transitions. [2022-11-18 20:55:55,046 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-18 20:55:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2219 transitions. [2022-11-18 20:55:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-18 20:55:55,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:55:55,047 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-18 20:55:55,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:55,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:55,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:55:55,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:55:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-18 20:55:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:55:55,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098421563] [2022-11-18 20:55:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:55:55,265 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-18 20:55:55,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:55:55,266 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:55,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:55:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:55:55,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:55:55,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:55,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-18 20:55:55,758 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-18 20:55:56,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:55:56,345 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-18 20:55:56,373 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:55:56,374 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-18 20:55:56,397 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-18 20:55:56,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:55:56,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:55:56,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098421563] [2022-11-18 20:55:56,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098421563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:55:56,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:55:56,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:55:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770198429] [2022-11-18 20:55:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:55:56,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:55:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:55:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:55:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:55:56,400 INFO L87 Difference]: Start difference. First operand 1922 states and 2219 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-18 20:56:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:02,811 INFO L93 Difference]: Finished difference Result 2109 states and 2390 transitions. [2022-11-18 20:56:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:56:02,811 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-18 20:56:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:02,819 INFO L225 Difference]: With dead ends: 2109 [2022-11-18 20:56:02,819 INFO L226 Difference]: Without dead ends: 2109 [2022-11-18 20:56:02,820 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-18 20:56:02,820 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 1569 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:02,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1304 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-18 20:56:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-18 20:56:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1672. [2022-11-18 20:56:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 974 states have (on average 1.8439425051334701) internal successors, (1796), 1663 states have internal predecessors, (1796), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:56:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1818 transitions. [2022-11-18 20:56:02,854 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1818 transitions. Word has length 53 [2022-11-18 20:56:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:02,855 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1818 transitions. [2022-11-18 20:56:02,855 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-18 20:56:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1818 transitions. [2022-11-18 20:56:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:56:02,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:02,856 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-18 20:56:02,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:03,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:03,071 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-18 20:56:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:03,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197918507] [2022-11-18 20:56:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:56:03,072 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-18 20:56:03,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:03,075 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:03,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:56:03,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:56:03,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:03,518 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-18 20:56:03,539 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-18 20:56:03,577 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-18 20:56:03,596 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-18 20:56:03,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:56:03,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197918507] [2022-11-18 20:56:03,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197918507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:56:03,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:56:03,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:56:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572732822] [2022-11-18 20:56:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:56:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:56:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:03,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:56:03,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:56:03,602 INFO L87 Difference]: Start difference. First operand 1672 states and 1818 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-18 20:56:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:09,392 INFO L93 Difference]: Finished difference Result 1671 states and 1817 transitions. [2022-11-18 20:56:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:56:09,393 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-18 20:56:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:09,399 INFO L225 Difference]: With dead ends: 1671 [2022-11-18 20:56:09,399 INFO L226 Difference]: Without dead ends: 1671 [2022-11-18 20:56:09,399 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-18 20:56:09,400 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 4 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:09,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4144 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-18 20:56:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-11-18 20:56:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2022-11-18 20:56:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 974 states have (on average 1.8429158110882957) internal successors, (1795), 1662 states have internal predecessors, (1795), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:56:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1817 transitions. [2022-11-18 20:56:09,431 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1817 transitions. Word has length 58 [2022-11-18 20:56:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:09,431 INFO L495 AbstractCegarLoop]: Abstraction has 1671 states and 1817 transitions. [2022-11-18 20:56:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:56:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1817 transitions. [2022-11-18 20:56:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:56:09,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:09,433 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-18 20:56:09,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-18 20:56:09,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:09,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-18 20:56:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:09,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946902813] [2022-11-18 20:56:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:56:09,649 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-18 20:56:09,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:09,651 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:09,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:56:10,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:56:10,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:10,055 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-18 20:56:10,093 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-18 20:56:10,105 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-18 20:56:10,175 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-18 20:56:10,185 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-18 20:56:10,206 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-18 20:56:10,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:56:10,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:10,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946902813] [2022-11-18 20:56:10,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946902813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:56:10,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:56:10,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:56:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094452303] [2022-11-18 20:56:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:56:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:56:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:56:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:56:10,208 INFO L87 Difference]: Start difference. First operand 1671 states and 1817 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-18 20:56:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:18,145 INFO L93 Difference]: Finished difference Result 1670 states and 1816 transitions. [2022-11-18 20:56:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:56:18,146 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-18 20:56:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:18,150 INFO L225 Difference]: With dead ends: 1670 [2022-11-18 20:56:18,151 INFO L226 Difference]: Without dead ends: 1670 [2022-11-18 20:56:18,151 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-18 20:56:18,152 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 2 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:18,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4202 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-18 20:56:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-11-18 20:56:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2022-11-18 20:56:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 973 states have (on average 1.8437821171634121) internal successors, (1794), 1661 states have internal predecessors, (1794), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:56:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 1816 transitions. [2022-11-18 20:56:18,178 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 1816 transitions. Word has length 58 [2022-11-18 20:56:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:18,178 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 1816 transitions. [2022-11-18 20:56:18,178 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-18 20:56:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1816 transitions. [2022-11-18 20:56:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:56:18,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:18,180 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-18 20:56:18,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 20:56:18,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:18,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2024861438, now seen corresponding path program 1 times [2022-11-18 20:56:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:18,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031905123] [2022-11-18 20:56:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:56:18,396 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-18 20:56:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:18,397 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:18,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:56:18,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:56:18,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:18,810 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-18 20:56:18,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:56:18,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031905123] [2022-11-18 20:56:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031905123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:56:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:56:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:56:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507207715] [2022-11-18 20:56:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:56:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:56:18,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:56:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:56:18,815 INFO L87 Difference]: Start difference. First operand 1670 states and 1816 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-18 20:56:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:18,903 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-11-18 20:56:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:56:18,904 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-18 20:56:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:18,910 INFO L225 Difference]: With dead ends: 1673 [2022-11-18 20:56:18,910 INFO L226 Difference]: Without dead ends: 1673 [2022-11-18 20:56:18,910 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-18 20:56:18,911 INFO L413 NwaCegarLoop]: 1630 mSDtfsCounter, 2 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4882 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:18,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4882 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:56:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-11-18 20:56:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-11-18 20:56:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 975 states have (on average 1.843076923076923) internal successors, (1797), 1664 states have internal predecessors, (1797), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 20:56:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-11-18 20:56:18,940 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 66 [2022-11-18 20:56:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:18,940 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-11-18 20:56:18,941 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-18 20:56:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-11-18 20:56:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-18 20:56:18,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:18,941 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-18 20:56:18,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:19,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:19,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1657441321, now seen corresponding path program 1 times [2022-11-18 20:56:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:19,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573795011] [2022-11-18 20:56:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:56:19,157 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-18 20:56:19,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:19,158 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:19,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:56:19,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:56:19,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:19,608 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-18 20:56:19,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:56:19,724 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-18 20:56:19,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573795011] [2022-11-18 20:56:19,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573795011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:56:19,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:56:19,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-18 20:56:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506897565] [2022-11-18 20:56:19,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:56:19,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:56:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:19,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:56:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:56:19,732 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 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-18 20:56:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:20,043 INFO L93 Difference]: Finished difference Result 1685 states and 1839 transitions. [2022-11-18 20:56:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:56:20,044 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-18 20:56:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:20,049 INFO L225 Difference]: With dead ends: 1685 [2022-11-18 20:56:20,050 INFO L226 Difference]: Without dead ends: 1685 [2022-11-18 20:56:20,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 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-18 20:56:20,051 INFO L413 NwaCegarLoop]: 1630 mSDtfsCounter, 22 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6503 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:20,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6503 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:56:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2022-11-18 20:56:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2022-11-18 20:56:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 984 states have (on average 1.8414634146341464) internal successors, (1812), 1673 states have internal predecessors, (1812), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 20:56:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1836 transitions. [2022-11-18 20:56:20,080 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1836 transitions. Word has length 67 [2022-11-18 20:56:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:20,080 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 1836 transitions. [2022-11-18 20:56:20,080 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-18 20:56:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1836 transitions. [2022-11-18 20:56:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:56:20,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:20,082 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-18 20:56:20,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:20,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:20,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1206395586, now seen corresponding path program 2 times [2022-11-18 20:56:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:20,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252036188] [2022-11-18 20:56:20,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:56:20,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:56:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:20,298 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:20,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Waiting until timeout for monitored process [2022-11-18 20:56:20,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:56:20,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:56:20,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:56:20,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:20,948 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-18 20:56:20,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:56:21,204 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-18 20:56:21,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:21,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252036188] [2022-11-18 20:56:21,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252036188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:56:21,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:56:21,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-18 20:56:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159645049] [2022-11-18 20:56:21,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:56:21,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:56:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:56:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:56:21,207 INFO L87 Difference]: Start difference. First operand 1683 states and 1836 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-18 20:56:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:22,132 INFO L93 Difference]: Finished difference Result 1704 states and 1868 transitions. [2022-11-18 20:56:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:56:22,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 70 [2022-11-18 20:56:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:22,138 INFO L225 Difference]: With dead ends: 1704 [2022-11-18 20:56:22,138 INFO L226 Difference]: Without dead ends: 1700 [2022-11-18 20:56:22,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:56:22,140 INFO L413 NwaCegarLoop]: 1633 mSDtfsCounter, 62 mSDsluCounter, 8143 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 9776 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:22,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 9776 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:56:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2022-11-18 20:56:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1692. [2022-11-18 20:56:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 993 states have (on average 1.836858006042296) internal successors, (1824), 1682 states have internal predecessors, (1824), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 20:56:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 1848 transitions. [2022-11-18 20:56:22,198 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 1848 transitions. Word has length 70 [2022-11-18 20:56:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:22,198 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 1848 transitions. [2022-11-18 20:56:22,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-18 20:56:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 1848 transitions. [2022-11-18 20:56:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-18 20:56:22,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:22,212 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:56:22,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 20:56:22,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:22,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash -365877602, now seen corresponding path program 3 times [2022-11-18 20:56:22,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:22,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489975390] [2022-11-18 20:56:22,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:56:22,437 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-18 20:56:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:22,438 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:22,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-18 20:56:23,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-18 20:56:23,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:56:23,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:56:23,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:56:23,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:56:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:56:24,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:24,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489975390] [2022-11-18 20:56:24,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489975390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:56:24,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:56:24,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-18 20:56:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474683837] [2022-11-18 20:56:24,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:56:24,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:56:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:56:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:56:24,730 INFO L87 Difference]: Start difference. First operand 1692 states and 1848 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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-18 20:56:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:29,788 INFO L93 Difference]: Finished difference Result 1734 states and 1924 transitions. [2022-11-18 20:56:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-18 20:56:29,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-18 20:56:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:29,793 INFO L225 Difference]: With dead ends: 1734 [2022-11-18 20:56:29,793 INFO L226 Difference]: Without dead ends: 1728 [2022-11-18 20:56:29,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 20:56:29,794 INFO L413 NwaCegarLoop]: 1637 mSDtfsCounter, 160 mSDsluCounter, 17951 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 19588 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:29,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 19588 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 20:56:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-11-18 20:56:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1710. [2022-11-18 20:56:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1011 states have (on average 1.8269040553907023) internal successors, (1847), 1700 states have internal predecessors, (1847), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 20:56:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1871 transitions. [2022-11-18 20:56:29,826 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 1871 transitions. Word has length 76 [2022-11-18 20:56:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:29,826 INFO L495 AbstractCegarLoop]: Abstraction has 1710 states and 1871 transitions. [2022-11-18 20:56:29,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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-18 20:56:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 1871 transitions. [2022-11-18 20:56:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 20:56:29,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:29,828 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:56:29,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:56:30,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:30,043 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2057559714, now seen corresponding path program 4 times [2022-11-18 20:56:30,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:30,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787156551] [2022-11-18 20:56:30,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:56:30,044 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-18 20:56:30,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:30,046 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:30,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:30,577 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:56:30,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:56:30,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:56:30,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:56:31,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:56:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:56:33,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:33,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787156551] [2022-11-18 20:56:33,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787156551] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:56:33,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:56:33,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-18 20:56:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241170691] [2022-11-18 20:56:33,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:56:33,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-18 20:56:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-18 20:56:33,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-18 20:56:33,773 INFO L87 Difference]: Start difference. First operand 1710 states and 1871 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 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-18 20:56:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:56:48,543 INFO L93 Difference]: Finished difference Result 1790 states and 2004 transitions. [2022-11-18 20:56:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-18 20:56:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 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 88 [2022-11-18 20:56:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:56:48,549 INFO L225 Difference]: With dead ends: 1790 [2022-11-18 20:56:48,550 INFO L226 Difference]: Without dead ends: 1786 [2022-11-18 20:56:48,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-18 20:56:48,553 INFO L413 NwaCegarLoop]: 1650 mSDtfsCounter, 458 mSDsluCounter, 42705 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 44355 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:56:48,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 44355 Invalid, 3512 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [385 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-18 20:56:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2022-11-18 20:56:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1744. [2022-11-18 20:56:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1045 states have (on average 1.8114832535885168) internal successors, (1893), 1734 states have internal predecessors, (1893), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 20:56:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 1917 transitions. [2022-11-18 20:56:48,594 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 1917 transitions. Word has length 88 [2022-11-18 20:56:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:56:48,594 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 1917 transitions. [2022-11-18 20:56:48,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 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-18 20:56:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 1917 transitions. [2022-11-18 20:56:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:56:48,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:56:48,596 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] [2022-11-18 20:56:48,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 20:56:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:48,811 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:56:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:56:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1917799358, now seen corresponding path program 5 times [2022-11-18 20:56:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:56:48,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31260884] [2022-11-18 20:56:48,812 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:56:48,812 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-18 20:56:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:56:48,813 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:56:48,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-18 20:56:50,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-18 20:56:50,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:56:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-18 20:56:50,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:56:50,421 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-18 20:56:50,595 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:56:50,595 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-18 20:56:50,637 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-18 20:56:50,766 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-18 20:56:51,317 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1609)))) is different from true [2022-11-18 20:56:51,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1615) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:56:52,713 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1641) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:56:52,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:56:52,871 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-18 20:56:52,936 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-18 20:56:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-18 20:56:52,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:56:53,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-18 20:56:53,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:53,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31260884] [2022-11-18 20:56:53,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31260884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:56:53,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2088717145] [2022-11-18 20:56:53,371 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:56:53,371 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:56:53,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:56:53,373 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:56:53,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-18 20:58:12,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-18 20:58:12,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:58:12,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-18 20:58:12,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:12,661 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-18 20:58:12,870 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:58:12,871 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-18 20:58:12,892 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-18 20:58:12,967 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-18 20:58:14,742 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2087)))) is different from true [2022-11-18 20:58:14,992 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:58:14,993 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-18 20:58:15,060 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-18 20:58:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-18 20:58:15,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:15,439 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2137) |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-18 20:58:15,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2088717145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:15,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:58:15,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2022-11-18 20:58:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41991059] [2022-11-18 20:58:15,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:58:15,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:58:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:58:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:58:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=82, Unknown=14, NotChecked=138, Total=272 [2022-11-18 20:58:15,444 INFO L87 Difference]: Start difference. First operand 1744 states and 1917 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:58:15,843 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1609))) (exists ((v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2087))) (exists ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1641) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:58:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:24,080 INFO L93 Difference]: Finished difference Result 2067 states and 2227 transitions. [2022-11-18 20:58:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:58:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-11-18 20:58:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:24,086 INFO L225 Difference]: With dead ends: 2067 [2022-11-18 20:58:24,086 INFO L226 Difference]: Without dead ends: 2063 [2022-11-18 20:58:24,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 125 SyntacticMatches, 86 SemanticMatches, 19 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=59, Invalid=133, Unknown=18, NotChecked=210, Total=420 [2022-11-18 20:58:24,088 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 1140 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 5375 SdHoareTripleChecker+Invalid, 12584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9625 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:24,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 5375 Invalid, 12584 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2948 Invalid, 0 Unknown, 9625 Unchecked, 8.3s Time] [2022-11-18 20:58:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-11-18 20:58:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1792. [2022-11-18 20:58:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1093 states have (on average 1.7758462946020128) internal successors, (1941), 1781 states have internal predecessors, (1941), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 20:58:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 1965 transitions. [2022-11-18 20:58:24,122 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 1965 transitions. Word has length 110 [2022-11-18 20:58:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:24,123 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 1965 transitions. [2022-11-18 20:58:24,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:58:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 1965 transitions. [2022-11-18 20:58:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:58:24,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:24,125 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] [2022-11-18 20:58:24,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:24,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-11-18 20:58:24,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:58:24,549 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 20:58:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1917799359, now seen corresponding path program 1 times [2022-11-18 20:58:24,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:58:24,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871438623] [2022-11-18 20:58:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:24,550 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-18 20:58:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:58:24,551 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:58:24,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:58:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:25,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-18 20:58:25,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:25,575 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-18 20:58:25,736 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:58:25,736 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-18 20:58:25,748 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-18 20:58:25,776 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-18 20:58:25,789 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-18 20:58:25,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 20:58:25,952 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-18 20:58:26,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:26,045 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-11-18 20:58:26,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-11-18 20:58:26,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:58:26,165 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 20:58:26,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-11-18 20:58:26,504 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:58:26,516 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531)))) is different from true [2022-11-18 20:58:26,536 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:26,550 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-11-18 20:58:26,602 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 20:58:26,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 20:58:26,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:26,719 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:58:26,846 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:58:26,900 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:26,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567)))) is different from true [2022-11-18 20:58:27,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:27,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:27,285 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 20:58:27,345 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:58:27,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 20:58:27,362 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-18 20:58:27,413 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-18 20:58:27,422 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-18 20:58:27,459 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-18 20:58:27,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:58:28,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-18 20:58:28,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:58:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871438623] [2022-11-18 20:58:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871438623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1063503057] [2022-11-18 20:58:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:58:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:58:28,793 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:58:28,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-18 21:00:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:26,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-18 21:00:26,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:00:26,876 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-18 21:00:27,027 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-18 21:00:27,043 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 21:00:27,044 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-18 21:00:27,058 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-18 21:00:27,074 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-18 21:00:27,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 22 treesize of output 10 [2022-11-18 21:00:27,180 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-18 21:00:27,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,354 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047)))) is different from true [2022-11-18 21:00:27,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,384 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,413 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055)))) is different from true [2022-11-18 21:00:27,430 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:00:27,490 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064)))) is different from true [2022-11-18 21:00:27,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:27,658 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:00:27,883 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085)))) is different from true [2022-11-18 21:00:27,988 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,004 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103)))) is different from true [2022-11-18 21:00:28,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,232 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108)))) is different from true [2022-11-18 21:00:28,248 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,264 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113)))) is different from true [2022-11-18 21:00:28,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,297 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:28,357 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:28,491 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:00:28,492 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-18 21:00:28,499 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-18 21:00:28,563 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-18 21:00:28,572 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-18 21:00:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2022-11-18 21:00:28,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:00:29,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |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_3217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-18 21:00:29,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1063503057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:00:29,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:00:29,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 52 [2022-11-18 21:00:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253929217] [2022-11-18 21:00:29,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:00:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-18 21:00:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:00:29,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-18 21:00:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=126, Unknown=53, NotChecked=2898, Total=3192 [2022-11-18 21:00:29,652 INFO L87 Difference]: Start difference. First operand 1792 states and 1965 transitions. Second operand has 53 states, 51 states have (on average 2.607843137254902) internal successors, (133), 53 states have internal predecessors, (133), 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-18 21:00:30,242 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-18 21:00:30,246 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,312 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,331 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,350 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:30,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:00:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:00:44,128 INFO L93 Difference]: Finished difference Result 2062 states and 2220 transitions. [2022-11-18 21:00:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 21:00:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.607843137254902) internal successors, (133), 53 states have internal predecessors, (133), 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 110 [2022-11-18 21:00:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:00:44,133 INFO L225 Difference]: With dead ends: 2062 [2022-11-18 21:00:44,134 INFO L226 Difference]: Without dead ends: 2062 [2022-11-18 21:00:44,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 125 SyntacticMatches, 46 SemanticMatches, 70 ConstructedPredicates, 55 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=171, Invalid=253, Unknown=68, NotChecked=4620, Total=5112 [2022-11-18 21:00:44,136 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 1134 mSDsluCounter, 4052 mSDsCounter, 0 mSdLazyCounter, 5064 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 79052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73976 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-11-18 21:00:44,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 5102 Invalid, 79052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 5064 Invalid, 0 Unknown, 73976 Unchecked, 13.8s Time] [2022-11-18 21:00:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-11-18 21:00:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1791. [2022-11-18 21:00:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1093 states have (on average 1.7749313815187557) internal successors, (1940), 1780 states have internal predecessors, (1940), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 21:00:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 1964 transitions. [2022-11-18 21:00:44,168 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 1964 transitions. Word has length 110 [2022-11-18 21:00:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:00:44,168 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 1964 transitions. [2022-11-18 21:00:44,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.607843137254902) internal successors, (133), 53 states have internal predecessors, (133), 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-18 21:00:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 1964 transitions. [2022-11-18 21:00:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-18 21:00:44,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:00:44,171 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-18 21:00:44,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 21:00:44,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-18 21:00:44,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 21:00:44,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 21:00:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:44,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1505974903, now seen corresponding path program 1 times [2022-11-18 21:00:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:00:44,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453387160] [2022-11-18 21:00:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:44,597 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-18 21:00:44,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:00:44,599 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 21:00:44,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-18 21:00:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:45,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-18 21:00:45,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:00:45,838 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-18 21:00:46,019 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 21:00:46,019 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-18 21:00:46,053 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-18 21:00:46,175 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-18 21:00:47,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:00:48,196 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:00:48,196 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-18 21:00:48,340 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:00:48,340 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-18 21:00:48,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-18 21:00:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-18 21:00:48,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:00:48,486 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-18 21:00:50,954 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3672 (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~mem33#1.base| v_ArrVal_3672))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3626)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-18 21:00:50,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:00:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453387160] [2022-11-18 21:00:50,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453387160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:00:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749568590] [2022-11-18 21:00:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:50,959 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 21:00:50,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 21:00:50,960 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 21:00:50,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-18 21:00:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:55,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-18 21:00:55,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:00:55,784 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-18 21:00:55,955 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 21:00:55,956 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-18 21:00:55,978 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-18 21:00:56,071 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-18 21:00:56,803 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4051) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:00:58,141 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:00:58,141 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-18 21:00:58,245 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:00:58,246 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-18 21:00:58,277 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-18 21:00:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-18 21:00:58,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:00:59,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4127 (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~mem33#1.base| v_ArrVal_4127))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3626)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-18 21:00:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1749568590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:00:59,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:00:59,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2022-11-18 21:00:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114910947] [2022-11-18 21:00:59,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:00:59,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 21:00:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:00:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 21:00:59,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=135, Unknown=17, NotChecked=140, Total=342 [2022-11-18 21:00:59,033 INFO L87 Difference]: Start difference. First operand 1791 states and 1964 transitions. Second operand has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:00:59,464 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:09,328 INFO L93 Difference]: Finished difference Result 2061 states and 2219 transitions. [2022-11-18 21:01:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:01:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-11-18 21:01:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:09,333 INFO L225 Difference]: With dead ends: 2061 [2022-11-18 21:01:09,334 INFO L226 Difference]: Without dead ends: 2061 [2022-11-18 21:01:09,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 132 SyntacticMatches, 89 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=73, Invalid=202, Unknown=21, NotChecked=210, Total=506 [2022-11-18 21:01:09,335 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 1133 mSDsluCounter, 4713 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 5762 SdHoareTripleChecker+Invalid, 9750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6332 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:09,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 5762 Invalid, 9750 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 3406 Invalid, 0 Unknown, 6332 Unchecked, 10.0s Time] [2022-11-18 21:01:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2022-11-18 21:01:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1790. [2022-11-18 21:01:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1093 states have (on average 1.7740164684354987) internal successors, (1939), 1779 states have internal predecessors, (1939), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 21:01:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 1963 transitions. [2022-11-18 21:01:09,365 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 1963 transitions. Word has length 113 [2022-11-18 21:01:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:09,366 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 1963 transitions. [2022-11-18 21:01:09,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 1963 transitions. [2022-11-18 21:01:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-18 21:01:09,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:09,368 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-18 21:01:09,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-11-18 21:01:09,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-18 21:01:09,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 21:01:09,783 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 21:01:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1505974904, now seen corresponding path program 1 times [2022-11-18 21:01:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:01:09,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795162139] [2022-11-18 21:01:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:09,785 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-18 21:01:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:01:09,787 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 21:01:09,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Waiting until timeout for monitored process [2022-11-18 21:01:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:11,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-18 21:01:11,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:01:11,090 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-18 21:01:11,281 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 21:01:11,281 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-18 21:01:11,290 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-18 21:01:11,323 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-18 21:01:11,336 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-18 21:01:11,508 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-18 21:01:11,515 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-18 21:01:11,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495)))) is different from true [2022-11-18 21:01:11,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496)))) is different from true [2022-11-18 21:01:11,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498)))) is different from true [2022-11-18 21:01:11,658 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501)))) is different from true [2022-11-18 21:01:11,800 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4509))) (exists ((v_ArrVal_4508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4508) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:11,817 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4511))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4510)))) is different from true [2022-11-18 21:01:11,832 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4512))) (exists ((v_ArrVal_4513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4513)))) is different from true [2022-11-18 21:01:11,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-18 21:01:11,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4516))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4517) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:11,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518)))) is different from true [2022-11-18 21:01:11,892 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4520))) (exists ((v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4521) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:11,907 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4523) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4522)))) is different from true [2022-11-18 21:01:11,923 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4525))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4524) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:11,944 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526)))) is different from true [2022-11-18 21:01:11,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4528))) (exists ((v_ArrVal_4529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4529)))) is different from true [2022-11-18 21:01:11,980 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4531))) (exists ((v_ArrVal_4530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4530))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-18 21:01:11,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532)))) is different from true [2022-11-18 21:01:12,015 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4535))) (exists ((v_ArrVal_4534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4534) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:12,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4536) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4537)))) is different from true [2022-11-18 21:01:12,051 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4539))) (exists ((v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4538) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:12,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4540))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4541)))) is different from true [2022-11-18 21:01:12,088 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4542) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4543)))) is different from true [2022-11-18 21:01:12,106 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544)))) is different from true [2022-11-18 21:01:12,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4549) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4548)))) is different from true [2022-11-18 21:01:12,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4550))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4551)))) is different from true [2022-11-18 21:01:12,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4556)))) is different from true [2022-11-18 21:01:12,353 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-18 21:01:12,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4560))) (exists ((v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4561) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:12,388 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4562))) (exists ((v_ArrVal_4563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4563)))) is different from true [2022-11-18 21:01:12,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4564))) (exists ((v_ArrVal_4565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4565) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:12,421 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4566))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4567) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:12,440 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4568))) (exists ((v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4569) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:12,495 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4572))) (exists ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4573)))) is different from true [2022-11-18 21:01:12,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4574))) (exists ((v_ArrVal_4575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4575)))) is different from true [2022-11-18 21:01:12,524 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:01:12,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4581))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4580) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:12,634 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:01:12,635 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-18 21:01:12,650 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-18 21:01:12,794 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:01:12,794 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-18 21:01:12,822 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-18 21:01:12,857 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-18 21:01:12,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-18 21:01:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-18 21:01:12,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:01:13,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4583) |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_4582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-18 21:01:13,194 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_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-18 21:01:14,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4675))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4674) .cse0 v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (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_4674) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-18 21:01:14,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:01:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795162139] [2022-11-18 21:01:14,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795162139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:01:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345492427] [2022-11-18 21:01:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 21:01:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 21:01:14,360 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 21:01:14,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-18 21:01:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:19,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 21:01:19,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:01:19,743 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-18 21:01:19,752 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-18 21:01:20,358 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 21:01:20,358 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-18 21:01:20,384 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-18 21:01:20,467 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-18 21:01:20,476 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-18 21:01:20,651 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 20 treesize of output 8 [2022-11-18 21:01:20,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 21:01:21,464 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5050)))) is different from true [2022-11-18 21:01:22,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058)))) is different from true [2022-11-18 21:01:22,169 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5060) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:22,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5062)))) is different from true [2022-11-18 21:01:22,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5063) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:22,375 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065)))) is different from true [2022-11-18 21:01:22,386 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5066)))) is different from true [2022-11-18 21:01:22,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:23,570 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 21:01:23,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 21:01:24,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:01:24,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-18 21:01:24,200 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-18 21:01:24,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-18 21:01:24,352 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 17 treesize of output 9 [2022-11-18 21:01:24,357 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 15 treesize of output 7 [2022-11-18 21:01:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2022-11-18 21:01:24,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:01:24,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-11-18 21:01:28,500 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_5136 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5136))) (let ((.cse1 (select |c_#length| v_arrayElimCell_65)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (forall ((v_ArrVal_5088 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv8 32) (select (select (store .cse3 v_arrayElimCell_65 (store (select .cse3 v_arrayElimCell_65) (bvadd (_ bv16 32) .cse0) v_ArrVal_5088)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_5087 (_ BitVec 32))) (bvule .cse2 (select |c_#length| v_ArrVal_5087))) (bvule .cse2 .cse1)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_5136 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5136))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse5 (_ bv20 32)) (select |c_#length| v_arrayElimCell_65))) (forall ((v_prenex_6 (_ BitVec 32))) (let ((.cse6 (select (select (store .cse7 v_arrayElimCell_65 (store (select .cse7 v_arrayElimCell_65) (bvadd (_ bv16 32) .cse5) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse6) (bvadd (_ bv8 32) .cse6)))))))))) is different from false [2022-11-18 21:01:28,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1345492427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:01:28,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:01:28,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 20] total 64 [2022-11-18 21:01:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468063524] [2022-11-18 21:01:28,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:01:28,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-18 21:01:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:01:28,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-18 21:01:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=508, Unknown=77, NotChecked=4508, Total=5256 [2022-11-18 21:01:28,536 INFO L87 Difference]: Start difference. First operand 1790 states and 1963 transitions. Second operand has 65 states, 62 states have (on average 3.096774193548387) internal successors, (192), 65 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 21:02:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:02:04,330 INFO L93 Difference]: Finished difference Result 2611 states and 2813 transitions. [2022-11-18 21:02:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:02:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 3.096774193548387) internal successors, (192), 65 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-11-18 21:02:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:02:04,342 INFO L225 Difference]: With dead ends: 2611 [2022-11-18 21:02:04,342 INFO L226 Difference]: Without dead ends: 2611 [2022-11-18 21:02:04,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 125 SyntacticMatches, 46 SemanticMatches, 80 ConstructedPredicates, 49 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=255, Invalid=895, Unknown=102, NotChecked=5390, Total=6642 [2022-11-18 21:02:04,345 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 1730 mSDsluCounter, 9428 mSDsCounter, 0 mSdLazyCounter, 12646 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 10274 SdHoareTripleChecker+Invalid, 120556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107887 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2022-11-18 21:02:04,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 10274 Invalid, 120556 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [23 Valid, 12646 Invalid, 0 Unknown, 107887 Unchecked, 33.8s Time] [2022-11-18 21:02:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-11-18 21:02:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1789. [2022-11-18 21:02:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1093 states have (on average 1.7731015553522416) internal successors, (1938), 1778 states have internal predecessors, (1938), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-18 21:02:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 1962 transitions. [2022-11-18 21:02:04,376 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 1962 transitions. Word has length 113 [2022-11-18 21:02:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:02:04,377 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 1962 transitions. [2022-11-18 21:02:04,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 3.096774193548387) internal successors, (192), 65 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 21:02:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 1962 transitions. [2022-11-18 21:02:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-18 21:02:04,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:02:04,379 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-18 21:02:04,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 21:02:04,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-11-18 21:02:04,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 21:02:04,803 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-18 21:02:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:02:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash -729759675, now seen corresponding path program 1 times [2022-11-18 21:02:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:02:04,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951078091] [2022-11-18 21:02:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:04,804 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-18 21:02:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:02:04,805 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 21:02:04,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 21:02:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:06,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-18 21:02:06,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:06,147 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-18 21:02:06,363 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 21:02:06,364 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-18 21:02:06,402 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-18 21:02:06,569 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-18 21:02:06,885 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520)))) is different from true [2022-11-18 21:02:07,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5526)))) is different from true [2022-11-18 21:02:07,202 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527)))) is different from true [2022-11-18 21:02:07,746 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540)))) is different from true [2022-11-18 21:02:07,908 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543)))) is different from true [2022-11-18 21:02:07,931 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 21:02:08,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547)))) is different from true [2022-11-18 21:02:08,317 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-18 21:02:08,380 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5556)))) is different from true [2022-11-18 21:02:08,615 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:02:08,615 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-18 21:02:08,742 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:02:08,743 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-18 21:02:08,870 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 21:02:08,871 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-18 21:02:08,899 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-18 21:02:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2022-11-18 21:02:08,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:09,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5561 (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_5561) |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-18 21:02:09,046 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-18 21:02:09,070 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-18 21:02:09,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (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_5560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-18 21:02:09,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5607))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5560)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-18 21:02:09,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:02:09,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951078091] [2022-11-18 21:02:09,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951078091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:09,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1402549905] [2022-11-18 21:02:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:09,463 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 21:02:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 21:02:09,466 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 21:02:09,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d01794d1-373f-4891-af68-ba210202cc37/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-18 21:02:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:39,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-18 21:02:39,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:39,443 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-18 21:02:39,841 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 21:02:39,841 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-18 21:02:39,941 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-18 21:02:39,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:02:40,123 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-18 21:02:40,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 21:02:40,570 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992)))) is different from true [2022-11-18 21:02:41,490 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-11-18 21:02:41,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006)))) is different from true [2022-11-18 21:02:43,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 21:02:44,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:02:44,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2022-11-18 21:02:44,325 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-18 21:02:44,326 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 41 treesize of output 31 [2022-11-18 21:02:44,389 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-18 21:02:44,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:02:44,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:02:44,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:02:44,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:02:44,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-18 21:02:44,716 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 11 [2022-11-18 21:02:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-18 21:02:44,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:48,006 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 117414 treesize of output 79056