./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- 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-2329fc7 [2022-12-14 07:11:40,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:11:40,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:11:40,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:11:40,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:11:40,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:11:40,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:11:40,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:11:40,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:11:40,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:11:40,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:11:40,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:11:40,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:11:40,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:11:40,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:11:40,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:11:40,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:11:40,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:11:40,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:11:40,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:11:40,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:11:40,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:11:40,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:11:40,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:11:40,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:11:40,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:11:40,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:11:40,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:11:40,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:11:40,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:11:40,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:11:40,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:11:40,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:11:40,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:11:40,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:11:40,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:11:40,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:11:40,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:11:40,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:11:40,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:11:40,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:11:40,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 07:11:40,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:11:40,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:11:40,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:11:40,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:11:40,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:11:40,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:11:40,779 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:11:40,780 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:11:40,780 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:11:40,781 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:11:40,781 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:11:40,781 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:11:40,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:11:40,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:11:40,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:11:40,782 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:11:40,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:11:40,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:11:40,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:11:40,784 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:11:40,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:11:40,784 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:11:40,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:11:40,784 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:11:40,784 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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2022-12-14 07:11:40,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:11:40,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:11:40,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:11:40,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:11:40,980 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:11:40,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2022-12-14 07:11:43,588 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:11:43,813 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:11:43,814 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2022-12-14 07:11:43,827 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data/f0f32d3cd/b1fe773940d84c4794156ae2c1bbd7f9/FLAG3a8868be3 [2022-12-14 07:11:43,839 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data/f0f32d3cd/b1fe773940d84c4794156ae2c1bbd7f9 [2022-12-14 07:11:43,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:11:43,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:11:43,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:11:43,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:11:43,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:11:43,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:11:43" (1/1) ... [2022-12-14 07:11:43,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ef415b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:43, skipping insertion in model container [2022-12-14 07:11:43,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:11:43" (1/1) ... [2022-12-14 07:11:43,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:11:43,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:11:44,189 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[33021,33034] [2022-12-14 07:11:44,270 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:11:44,280 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[45234,45247] [2022-12-14 07:11:44,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:11:44,297 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-12-14 07:11:44,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19c7f33a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:44, skipping insertion in model container [2022-12-14 07:11:44,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:11:44,298 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 07:11:44,299 INFO L158 Benchmark]: Toolchain (without parser) took 456.24ms. Allocated memory is still 146.8MB. Free memory was 102.4MB in the beginning and 83.1MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 07:11:44,300 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:11:44,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.31ms. Allocated memory is still 146.8MB. Free memory was 102.2MB in the beginning and 83.1MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 07:11:44,301 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.14ms. Allocated memory is still 146.8MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.31ms. Allocated memory is still 146.8MB. Free memory was 102.2MB in the beginning and 83.1MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- 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-2329fc7 [2022-12-14 07:11:45,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:11:45,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:11:45,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:11:45,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:11:45,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:11:45,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:11:45,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:11:45,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:11:45,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:11:45,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:11:45,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:11:45,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:11:45,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:11:45,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:11:45,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:11:45,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:11:45,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:11:45,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:11:45,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:11:45,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:11:45,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:11:45,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:11:45,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:11:45,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:11:45,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:11:45,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:11:45,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:11:45,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:11:45,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:11:45,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:11:45,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:11:45,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:11:45,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:11:45,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:11:45,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:11:45,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:11:45,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:11:45,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:11:45,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:11:45,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:11:45,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 07:11:45,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:11:45,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:11:45,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:11:45,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:11:45,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:11:45,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:11:45,764 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:11:45,764 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:11:45,764 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:11:45,764 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:11:45,764 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:11:45,764 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:11:45,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:11:45,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:11:45,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:11:45,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:11:45,765 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:11:45,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:11:45,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:11:45,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:11:45,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:11:45,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 07:11:45,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:11:45,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:11:45,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:11:45,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:11:45,773 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 07:11:45,773 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 07:11:45,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:11:45,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 07:11:45,774 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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2022-12-14 07:11:46,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:11:46,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:11:46,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:11:46,031 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:11:46,031 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:11:46,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2022-12-14 07:11:48,631 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:11:48,868 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:11:48,869 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2022-12-14 07:11:48,882 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data/72ba3b278/e44ea76d95744562a6017e2e394655a6/FLAGbf76110f6 [2022-12-14 07:11:48,896 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/data/72ba3b278/e44ea76d95744562a6017e2e394655a6 [2022-12-14 07:11:48,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:11:48,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:11:48,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:11:48,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:11:48,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:11:48,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:11:48" (1/1) ... [2022-12-14 07:11:48,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769ad899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:48, skipping insertion in model container [2022-12-14 07:11:48,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:11:48" (1/1) ... [2022-12-14 07:11:48,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:11:48,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:11:49,247 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[33021,33034] [2022-12-14 07:11:49,309 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:11:49,316 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[45234,45247] [2022-12-14 07:11:49,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:11:49,329 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 07:11:49,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:11:49,357 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[33021,33034] [2022-12-14 07:11:49,395 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:11:49,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[45234,45247] [2022-12-14 07:11:49,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:11:49,406 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:11:49,424 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[33021,33034] [2022-12-14 07:11:49,449 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:11:49,454 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i[45234,45247] [2022-12-14 07:11:49,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:11:49,477 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:11:49,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49 WrapperNode [2022-12-14 07:11:49,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:11:49,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:11:49,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:11:49,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:11:49,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,537 INFO L138 Inliner]: procedures = 180, calls = 297, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1007 [2022-12-14 07:11:49,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:11:49,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:11:49,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:11:49,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:11:49,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,586 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:11:49,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:11:49,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:11:49,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:11:49,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (1/1) ... [2022-12-14 07:11:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:11:49,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:11:49,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:11:49,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:11:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 07:11:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 07:11:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 07:11:49,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 07:11:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 07:11:49,658 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 07:11:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-12-14 07:11:49,658 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 07:11:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 07:11:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:11:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:11:49,821 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:11:49,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:11:49,826 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 07:11:53,408 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:11:53,418 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:11:53,419 INFO L300 CfgBuilder]: Removed 62 assume(true) statements. [2022-12-14 07:11:53,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:11:53 BoogieIcfgContainer [2022-12-14 07:11:53,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:11:53,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:11:53,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:11:53,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:11:53,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:11:48" (1/3) ... [2022-12-14 07:11:53,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414bc08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:11:53, skipping insertion in model container [2022-12-14 07:11:53,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:11:49" (2/3) ... [2022-12-14 07:11:53,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414bc08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:11:53, skipping insertion in model container [2022-12-14 07:11:53,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:11:53" (3/3) ... [2022-12-14 07:11:53,427 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-1.i [2022-12-14 07:11:53,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:11:53,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-12-14 07:11:53,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:11:53,492 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;@a7f8fa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:11:53,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-12-14 07:11:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 1096 states, 539 states have (on average 2.241187384044527) internal successors, (1208), 1087 states have internal predecessors, (1208), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:11:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:11:53,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:11:53,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:11:53,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:11:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:11:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-12-14 07:11:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:11:53,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557002871] [2022-12-14 07:11:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:11:53,519 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-12-14 07:11:53,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:11:53,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:53,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:11:53,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:11:53,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:11:53,681 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-12-14 07:11:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:11:53,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:11:53,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:11:53,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557002871] [2022-12-14 07:11:53,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557002871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:11:53,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:11:53,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:11:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922506041] [2022-12-14 07:11:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:11:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:11:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:11:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:11:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:11:53,723 INFO L87 Difference]: Start difference. First operand has 1096 states, 539 states have (on average 2.241187384044527) internal successors, (1208), 1087 states have internal predecessors, (1208), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:11:55,200 INFO L93 Difference]: Finished difference Result 1099 states and 1184 transitions. [2022-12-14 07:11:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:11:55,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:11:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:11:55,216 INFO L225 Difference]: With dead ends: 1099 [2022-12-14 07:11:55,216 INFO L226 Difference]: Without dead ends: 1097 [2022-12-14 07:11:55,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:11:55,220 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 969 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:11:55,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 823 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 07:11:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-12-14 07:11:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1085. [2022-12-14 07:11:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 542 states have (on average 2.0904059040590406) internal successors, (1133), 1075 states have internal predecessors, (1133), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:11:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1175 transitions. [2022-12-14 07:11:55,280 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1175 transitions. Word has length 3 [2022-12-14 07:11:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:11:55,281 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1175 transitions. [2022-12-14 07:11:55,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1175 transitions. [2022-12-14 07:11:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:11:55,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:11:55,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:11:55,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:55,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:55,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:11:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:11:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-12-14 07:11:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:11:55,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543536055] [2022-12-14 07:11:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:11:55,488 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-12-14 07:11:55,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:11:55,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:55,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:11:55,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:11:55,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:11:55,625 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-12-14 07:11:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:11:55,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:11:55,635 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:11:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543536055] [2022-12-14 07:11:55,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543536055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:11:55,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:11:55,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:11:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677162097] [2022-12-14 07:11:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:11:55,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:11:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:11:55,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:11:55,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:11:55,638 INFO L87 Difference]: Start difference. First operand 1085 states and 1175 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:11:58,098 INFO L93 Difference]: Finished difference Result 1478 states and 1598 transitions. [2022-12-14 07:11:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:11:58,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:11:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:11:58,104 INFO L225 Difference]: With dead ends: 1478 [2022-12-14 07:11:58,104 INFO L226 Difference]: Without dead ends: 1478 [2022-12-14 07:11:58,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:11:58,105 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 421 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:11:58,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1608 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 07:11:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-12-14 07:11:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1289. [2022-12-14 07:11:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 746 states have (on average 2.0804289544235925) internal successors, (1552), 1278 states have internal predecessors, (1552), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 07:11:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1596 transitions. [2022-12-14 07:11:58,142 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1596 transitions. Word has length 3 [2022-12-14 07:11:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:11:58,143 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1596 transitions. [2022-12-14 07:11:58,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:11:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1596 transitions. [2022-12-14 07:11:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:11:58,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:11:58,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:11:58,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:11:58,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:58,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:11:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:11:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-12-14 07:11:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:11:58,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662247382] [2022-12-14 07:11:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:11:58,346 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-12-14 07:11:58,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:11:58,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:58,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:11:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:11:58,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:11:58,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:11:58,442 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-12-14 07:11:58,447 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-12-14 07:11:58,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:11:58,497 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-12-14 07:11:58,510 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:11:58,510 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-12-14 07:11:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:11:58,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:11:58,529 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:11:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662247382] [2022-12-14 07:11:58,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662247382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:11:58,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:11:58,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:11:58,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617478366] [2022-12-14 07:11:58,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:11:58,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:11:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:11:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:11:58,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:11:58,531 INFO L87 Difference]: Start difference. First operand 1289 states and 1596 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:00,711 INFO L93 Difference]: Finished difference Result 1294 states and 1599 transitions. [2022-12-14 07:12:00,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 07:12:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:00,717 INFO L225 Difference]: With dead ends: 1294 [2022-12-14 07:12:00,717 INFO L226 Difference]: Without dead ends: 1294 [2022-12-14 07:12:00,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:00,718 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 2023 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:00,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 517 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 07:12:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-12-14 07:12:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1074. [2022-12-14 07:12:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 542 states have (on average 2.0682656826568264) internal successors, (1121), 1064 states have internal predecessors, (1121), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:12:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1163 transitions. [2022-12-14 07:12:00,736 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1163 transitions. Word has length 7 [2022-12-14 07:12:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:00,736 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1163 transitions. [2022-12-14 07:12:00,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1163 transitions. [2022-12-14 07:12:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:12:00,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:00,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:00,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 07:12:00,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:00,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-12-14 07:12:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:00,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3897130] [2022-12-14 07:12:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:00,939 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-12-14 07:12:00,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:00,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:00,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:01,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:12:01,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:01,018 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-12-14 07:12:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:01,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:01,029 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:01,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3897130] [2022-12-14 07:12:01,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3897130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:01,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:01,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:12:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897902120] [2022-12-14 07:12:01,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:01,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:12:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:12:01,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:01,031 INFO L87 Difference]: Start difference. First operand 1074 states and 1163 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:02,765 INFO L93 Difference]: Finished difference Result 1401 states and 1517 transitions. [2022-12-14 07:12:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:12:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 07:12:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:02,768 INFO L225 Difference]: With dead ends: 1401 [2022-12-14 07:12:02,768 INFO L226 Difference]: Without dead ends: 1401 [2022-12-14 07:12:02,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:02,769 INFO L413 NwaCegarLoop]: 991 mSDtfsCounter, 986 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:02,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1296 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 07:12:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2022-12-14 07:12:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1027. [2022-12-14 07:12:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 542 states have (on average 1.9797047970479704) internal successors, (1073), 1017 states have internal predecessors, (1073), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:12:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1115 transitions. [2022-12-14 07:12:02,783 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1115 transitions. Word has length 8 [2022-12-14 07:12:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:02,783 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1115 transitions. [2022-12-14 07:12:02,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1115 transitions. [2022-12-14 07:12:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:12:02,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:02,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:02,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:02,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:02,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-12-14 07:12:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:02,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8781747] [2022-12-14 07:12:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:02,986 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-12-14 07:12:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:02,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:02,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:03,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:12:03,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:03,074 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-12-14 07:12:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:03,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:03,098 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8781747] [2022-12-14 07:12:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8781747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:03,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:12:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815682257] [2022-12-14 07:12:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:12:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:12:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:03,100 INFO L87 Difference]: Start difference. First operand 1027 states and 1115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:05,425 INFO L93 Difference]: Finished difference Result 1496 states and 1617 transitions. [2022-12-14 07:12:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:12:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 07:12:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:05,430 INFO L225 Difference]: With dead ends: 1496 [2022-12-14 07:12:05,430 INFO L226 Difference]: Without dead ends: 1496 [2022-12-14 07:12:05,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:05,431 INFO L413 NwaCegarLoop]: 1210 mSDtfsCounter, 686 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:05,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1694 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 07:12:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-12-14 07:12:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1269. [2022-12-14 07:12:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 792 states have (on average 1.9785353535353536) internal successors, (1567), 1257 states have internal predecessors, (1567), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1613 transitions. [2022-12-14 07:12:05,450 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1613 transitions. Word has length 8 [2022-12-14 07:12:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:05,450 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1613 transitions. [2022-12-14 07:12:05,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1613 transitions. [2022-12-14 07:12:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:12:05,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:05,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:05,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:05,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:05,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash -657954014, now seen corresponding path program 1 times [2022-12-14 07:12:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:05,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52967725] [2022-12-14 07:12:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:05,654 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-12-14 07:12:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:05,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:05,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:05,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:12:05,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:05,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:12:05,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:12:05,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:12:05,817 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 30 treesize of output 39 [2022-12-14 07:12:05,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:12:05,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-12-14 07:12:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:05,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:05,876 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:05,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52967725] [2022-12-14 07:12:05,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52967725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:05,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:05,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:12:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911429412] [2022-12-14 07:12:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:05,878 INFO L87 Difference]: Start difference. First operand 1269 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12-14 07:12:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:07,012 INFO L93 Difference]: Finished difference Result 1783 states and 2337 transitions. [2022-12-14 07:12:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-12-14 07:12:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:07,015 INFO L225 Difference]: With dead ends: 1783 [2022-12-14 07:12:07,016 INFO L226 Difference]: Without dead ends: 1783 [2022-12-14 07:12:07,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-12-14 07:12:07,016 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 357 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:07,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 3030 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 07:12:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-12-14 07:12:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1271. [2022-12-14 07:12:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 794 states have (on average 1.9760705289672544) internal successors, (1569), 1259 states have internal predecessors, (1569), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1615 transitions. [2022-12-14 07:12:07,032 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1615 transitions. Word has length 10 [2022-12-14 07:12:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:07,032 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1615 transitions. [2022-12-14 07:12:07,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12-14 07:12:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1615 transitions. [2022-12-14 07:12:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:12:07,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:07,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:07,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:07,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-12-14 07:12:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:07,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855471755] [2022-12-14 07:12:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:07,235 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-12-14 07:12:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:07,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:07,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:07,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:12:07,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:07,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:07,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:07,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855471755] [2022-12-14 07:12:07,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855471755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:07,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:07,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:12:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144741057] [2022-12-14 07:12:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:12:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:12:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:07,345 INFO L87 Difference]: Start difference. First operand 1271 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:07,362 INFO L93 Difference]: Finished difference Result 1240 states and 1583 transitions. [2022-12-14 07:12:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:12:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 07:12:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:07,365 INFO L225 Difference]: With dead ends: 1240 [2022-12-14 07:12:07,365 INFO L226 Difference]: Without dead ends: 1240 [2022-12-14 07:12:07,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:07,366 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 962 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1142 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-12-14 07:12:07,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1142 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:12:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-12-14 07:12:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1229. [2022-12-14 07:12:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 776 states have (on average 1.9664948453608246) internal successors, (1526), 1217 states have internal predecessors, (1526), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1572 transitions. [2022-12-14 07:12:07,384 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1572 transitions. Word has length 18 [2022-12-14 07:12:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:07,384 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1572 transitions. [2022-12-14 07:12:07,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1572 transitions. [2022-12-14 07:12:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:12:07,385 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:07,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:07,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-12-14 07:12:07,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:07,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-12-14 07:12:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:07,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698406294] [2022-12-14 07:12:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:07,587 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-12-14 07:12:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:07,588 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:07,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:07,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:12:07,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:07,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:07,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:07,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698406294] [2022-12-14 07:12:07,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698406294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:07,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:07,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:12:07,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736814391] [2022-12-14 07:12:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:07,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:07,731 INFO L87 Difference]: Start difference. First operand 1229 states and 1572 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:07,787 INFO L93 Difference]: Finished difference Result 1219 states and 1555 transitions. [2022-12-14 07:12:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 07:12:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:07,790 INFO L225 Difference]: With dead ends: 1219 [2022-12-14 07:12:07,790 INFO L226 Difference]: Without dead ends: 1219 [2022-12-14 07:12:07,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:12:07,790 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 943 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2095 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:07,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 2095 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:12:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-12-14 07:12:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1207. [2022-12-14 07:12:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 768 states have (on average 1.94921875) internal successors, (1497), 1195 states have internal predecessors, (1497), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1543 transitions. [2022-12-14 07:12:07,803 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1543 transitions. Word has length 20 [2022-12-14 07:12:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:07,803 INFO L495 AbstractCegarLoop]: Abstraction has 1207 states and 1543 transitions. [2022-12-14 07:12:07,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1543 transitions. [2022-12-14 07:12:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 07:12:07,803 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:07,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:07,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:08,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:08,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-12-14 07:12:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:08,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539042400] [2022-12-14 07:12:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:08,007 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-12-14 07:12:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:08,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:08,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:08,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:12:08,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:08,180 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-12-14 07:12:08,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-12-14 07:12:08,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:08,227 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:08,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539042400] [2022-12-14 07:12:08,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539042400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:08,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:08,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:12:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201450334] [2022-12-14 07:12:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:08,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:08,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:08,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:08,229 INFO L87 Difference]: Start difference. First operand 1207 states and 1543 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:09,859 INFO L93 Difference]: Finished difference Result 1795 states and 2365 transitions. [2022-12-14 07:12:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 07:12:09,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:09,863 INFO L225 Difference]: With dead ends: 1795 [2022-12-14 07:12:09,863 INFO L226 Difference]: Without dead ends: 1795 [2022-12-14 07:12:09,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:12:09,863 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 2098 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:09,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 993 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 07:12:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-12-14 07:12:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1203. [2022-12-14 07:12:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 768 states have (on average 1.9440104166666667) internal successors, (1493), 1191 states have internal predecessors, (1493), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1539 transitions. [2022-12-14 07:12:09,876 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1539 transitions. Word has length 34 [2022-12-14 07:12:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:09,877 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1539 transitions. [2022-12-14 07:12:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1539 transitions. [2022-12-14 07:12:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 07:12:09,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:09,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:09,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:10,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:10,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-12-14 07:12:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:10,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821614303] [2022-12-14 07:12:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:10,079 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-12-14 07:12:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:10,080 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:10,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:10,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:12:10,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:10,205 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-12-14 07:12:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:10,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:10,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:10,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821614303] [2022-12-14 07:12:10,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821614303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:10,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:10,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:12:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123753692] [2022-12-14 07:12:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:10,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:10,341 INFO L87 Difference]: Start difference. First operand 1203 states and 1539 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:13,173 INFO L93 Difference]: Finished difference Result 1437 states and 1550 transitions. [2022-12-14 07:12:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 07:12:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:13,176 INFO L225 Difference]: With dead ends: 1437 [2022-12-14 07:12:13,176 INFO L226 Difference]: Without dead ends: 1437 [2022-12-14 07:12:13,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:12:13,177 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 1176 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:13,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1723 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 07:12:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-12-14 07:12:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1199. [2022-12-14 07:12:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 768 states have (on average 1.9388020833333333) internal successors, (1489), 1187 states have internal predecessors, (1489), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1535 transitions. [2022-12-14 07:12:13,188 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1535 transitions. Word has length 34 [2022-12-14 07:12:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:13,188 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1535 transitions. [2022-12-14 07:12:13,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1535 transitions. [2022-12-14 07:12:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 07:12:13,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:13,189 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] [2022-12-14 07:12:13,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:13,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:13,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1045534242, now seen corresponding path program 1 times [2022-12-14 07:12:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:13,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018232397] [2022-12-14 07:12:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:13,394 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-12-14 07:12:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:13,395 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:13,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:13,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:12:13,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:13,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:13,595 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:13,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018232397] [2022-12-14 07:12:13,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018232397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:13,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:13,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:12:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041776519] [2022-12-14 07:12:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:13,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:13,597 INFO L87 Difference]: Start difference. First operand 1199 states and 1535 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-12-14 07:12:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:13,635 INFO L93 Difference]: Finished difference Result 1204 states and 1536 transitions. [2022-12-14 07:12:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2022-12-14 07:12:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:13,638 INFO L225 Difference]: With dead ends: 1204 [2022-12-14 07:12:13,638 INFO L226 Difference]: Without dead ends: 1204 [2022-12-14 07:12:13,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-12-14 07:12:13,638 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 912 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:13,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2073 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:12:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-12-14 07:12:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1193. [2022-12-14 07:12:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 762 states have (on average 1.9409448818897639) internal successors, (1479), 1181 states have internal predecessors, (1479), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:12:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1525 transitions. [2022-12-14 07:12:13,650 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1525 transitions. Word has length 49 [2022-12-14 07:12:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:13,650 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1525 transitions. [2022-12-14 07:12:13,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-12-14 07:12:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1525 transitions. [2022-12-14 07:12:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 07:12:13,651 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:13,651 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] [2022-12-14 07:12:13,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:13,852 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -551406574, now seen corresponding path program 1 times [2022-12-14 07:12:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:13,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2399339] [2022-12-14 07:12:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:13,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:12:13,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:13,854 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:13,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:14,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:12:14,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:14,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:14,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:14,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2399339] [2022-12-14 07:12:14,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2399339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:14,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:14,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:12:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759648216] [2022-12-14 07:12:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:14,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:12:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:12:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:14,197 INFO L87 Difference]: Start difference. First operand 1193 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-14 07:12:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:14,399 INFO L93 Difference]: Finished difference Result 1735 states and 2262 transitions. [2022-12-14 07:12:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:12:14,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2022-12-14 07:12:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:14,405 INFO L225 Difference]: With dead ends: 1735 [2022-12-14 07:12:14,405 INFO L226 Difference]: Without dead ends: 1735 [2022-12-14 07:12:14,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-12-14 07:12:14,406 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 407 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:14,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2069 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:12:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-12-14 07:12:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1556. [2022-12-14 07:12:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1123 states have (on average 1.9225289403383794) internal successors, (2159), 1542 states have internal predecessors, (2159), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:12:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2209 transitions. [2022-12-14 07:12:14,420 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2209 transitions. Word has length 57 [2022-12-14 07:12:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:14,421 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 2209 transitions. [2022-12-14 07:12:14,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-14 07:12:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2209 transitions. [2022-12-14 07:12:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 07:12:14,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:14,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:14,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-12-14 07:12:14,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:14,622 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-12-14 07:12:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:14,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393845601] [2022-12-14 07:12:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:14,626 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-12-14 07:12:14,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:14,628 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:14,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:15,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:12:15,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:15,024 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-12-14 07:12:15,028 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-12-14 07:12:15,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:12:15,398 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-12-14 07:12:15,409 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:12:15,410 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-12-14 07:12:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:15,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:15,420 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:15,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393845601] [2022-12-14 07:12:15,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393845601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:15,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:15,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:12:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174340746] [2022-12-14 07:12:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:15,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:15,421 INFO L87 Difference]: Start difference. First operand 1556 states and 2209 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:17,127 INFO L93 Difference]: Finished difference Result 1527 states and 2181 transitions. [2022-12-14 07:12:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-12-14 07:12:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:17,131 INFO L225 Difference]: With dead ends: 1527 [2022-12-14 07:12:17,131 INFO L226 Difference]: Without dead ends: 1527 [2022-12-14 07:12:17,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:17,131 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 1620 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:17,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 454 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 07:12:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-12-14 07:12:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1108. [2022-12-14 07:12:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 718 states have (on average 1.809192200557103) internal successors, (1299), 1097 states have internal predecessors, (1299), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 07:12:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1343 transitions. [2022-12-14 07:12:17,143 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1343 transitions. Word has length 60 [2022-12-14 07:12:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:17,143 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1343 transitions. [2022-12-14 07:12:17,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1343 transitions. [2022-12-14 07:12:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 07:12:17,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:17,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:17,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:17,345 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-12-14 07:12:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:17,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425621233] [2022-12-14 07:12:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:17,349 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-12-14 07:12:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:17,352 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:17,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:17,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:12:17,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:17,660 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-12-14 07:12:17,671 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-12-14 07:12:17,690 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-12-14 07:12:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:17,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:17,698 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:17,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425621233] [2022-12-14 07:12:17,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425621233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:17,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:17,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:12:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984247583] [2022-12-14 07:12:17,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:17,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:12:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:12:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:12:17,699 INFO L87 Difference]: Start difference. First operand 1108 states and 1343 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:19,704 INFO L93 Difference]: Finished difference Result 1107 states and 1342 transitions. [2022-12-14 07:12:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:12:19,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-12-14 07:12:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:19,706 INFO L225 Difference]: With dead ends: 1107 [2022-12-14 07:12:19,706 INFO L226 Difference]: Without dead ends: 1107 [2022-12-14 07:12:19,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:12:19,707 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 4 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:19,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2524 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 07:12:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-12-14 07:12:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2022-12-14 07:12:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 718 states have (on average 1.807799442896936) internal successors, (1298), 1096 states have internal predecessors, (1298), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 07:12:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1342 transitions. [2022-12-14 07:12:19,720 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1342 transitions. Word has length 65 [2022-12-14 07:12:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:19,720 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1342 transitions. [2022-12-14 07:12:19,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1342 transitions. [2022-12-14 07:12:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 07:12:19,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:19,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:19,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:19,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:19,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-12-14 07:12:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:19,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654794156] [2022-12-14 07:12:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:19,926 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-12-14 07:12:19,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:19,928 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:19,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:20,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:12:20,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:20,161 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-12-14 07:12:20,174 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-12-14 07:12:20,182 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-12-14 07:12:20,222 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-12-14 07:12:20,227 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-12-14 07:12:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:20,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:20,237 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:20,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654794156] [2022-12-14 07:12:20,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654794156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:20,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:20,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:12:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665257656] [2022-12-14 07:12:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:20,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:12:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:12:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:12:20,239 INFO L87 Difference]: Start difference. First operand 1107 states and 1342 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:23,013 INFO L93 Difference]: Finished difference Result 1106 states and 1341 transitions. [2022-12-14 07:12:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:12:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-12-14 07:12:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:23,020 INFO L225 Difference]: With dead ends: 1106 [2022-12-14 07:12:23,020 INFO L226 Difference]: Without dead ends: 1106 [2022-12-14 07:12:23,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:12:23,020 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:23,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2569 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 07:12:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-12-14 07:12:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2022-12-14 07:12:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 717 states have (on average 1.808926080892608) internal successors, (1297), 1095 states have internal predecessors, (1297), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 07:12:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1341 transitions. [2022-12-14 07:12:23,029 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1341 transitions. Word has length 65 [2022-12-14 07:12:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:23,029 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1341 transitions. [2022-12-14 07:12:23,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1341 transitions. [2022-12-14 07:12:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 07:12:23,029 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:23,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:23,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,231 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -599006260, now seen corresponding path program 1 times [2022-12-14 07:12:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:23,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39911369] [2022-12-14 07:12:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:23,234 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-12-14 07:12:23,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:23,237 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:23,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:12:23,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:23,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:23,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39911369] [2022-12-14 07:12:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39911369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:23,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:12:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316172647] [2022-12-14 07:12:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:23,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:23,482 INFO L87 Difference]: Start difference. First operand 1106 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 07:12:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:23,517 INFO L93 Difference]: Finished difference Result 1109 states and 1345 transitions. [2022-12-14 07:12:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:12:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-12-14 07:12:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:23,520 INFO L225 Difference]: With dead ends: 1109 [2022-12-14 07:12:23,520 INFO L226 Difference]: Without dead ends: 1109 [2022-12-14 07:12:23,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:12:23,520 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:23,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2866 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:12:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-12-14 07:12:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-12-14 07:12:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 719 states have (on average 1.8080667593880388) internal successors, (1300), 1098 states have internal predecessors, (1300), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:12:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1345 transitions. [2022-12-14 07:12:23,533 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1345 transitions. Word has length 73 [2022-12-14 07:12:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:23,533 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1345 transitions. [2022-12-14 07:12:23,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 07:12:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1345 transitions. [2022-12-14 07:12:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 07:12:23,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:23,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:23,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:12:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -481982235, now seen corresponding path program 1 times [2022-12-14 07:12:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:23,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699561345] [2022-12-14 07:12:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:23,736 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-12-14 07:12:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:23,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:23,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:12:23,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:23,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:24,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699561345] [2022-12-14 07:12:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699561345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:12:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [658086629] [2022-12-14 07:12:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:24,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:12:24,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:12:24,043 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:12:24,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-12-14 07:12:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:24,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:12:24,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:24,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:24,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [658086629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:12:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857422890] [2022-12-14 07:12:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:12:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:12:24,439 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:12:24,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 07:12:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:24,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:12:24,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:24,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:24,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857422890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:12:24,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 07:12:24,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 07:12:24,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808389448] [2022-12-14 07:12:24,721 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 07:12:24,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:12:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:12:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:12:24,723 INFO L87 Difference]: Start difference. First operand 1109 states and 1345 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 07:12:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:24,853 INFO L93 Difference]: Finished difference Result 1121 states and 1362 transitions. [2022-12-14 07:12:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:12:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-12-14 07:12:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:24,856 INFO L225 Difference]: With dead ends: 1121 [2022-12-14 07:12:24,856 INFO L226 Difference]: Without dead ends: 1121 [2022-12-14 07:12:24,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:12:24,856 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 12 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:24,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2870 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:12:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2022-12-14 07:12:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1119. [2022-12-14 07:12:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 728 states have (on average 1.8063186813186813) internal successors, (1315), 1107 states have internal predecessors, (1315), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:12:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1360 transitions. [2022-12-14 07:12:24,867 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1360 transitions. Word has length 74 [2022-12-14 07:12:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:24,867 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1360 transitions. [2022-12-14 07:12:24,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 07:12:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1360 transitions. [2022-12-14 07:12:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 07:12:24,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:24,868 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:24,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2022-12-14 07:12:25,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:25,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 07:12:25,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:12:25,470 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:12:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1608982004, now seen corresponding path program 2 times [2022-12-14 07:12:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:25,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913463977] [2022-12-14 07:12:25,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:12:25,473 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-12-14 07:12:25,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:25,476 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:12:25,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Waiting until timeout for monitored process [2022-12-14 07:12:25,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:12:25,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:12:25,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:12:25,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:25,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:26,059 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:26,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913463977] [2022-12-14 07:12:26,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913463977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:12:26,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2051436148] [2022-12-14 07:12:26,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:12:26,060 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:12:26,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:12:26,061 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:12:26,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-12-14 07:12:27,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:12:27,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:12:27,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:12:27,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:27,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2051436148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:12:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753152194] [2022-12-14 07:12:27,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:12:27,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:12:27,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:12:27,386 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:12:27,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 07:12:49,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:12:49,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:12:49,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 07:12:49,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:49,519 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:12:49,520 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-12-14 07:12:49,540 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-12-14 07:12:49,905 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:12:49,905 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-12-14 07:12:49,976 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-12-14 07:12:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:12:50,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:12:50,090 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 07:12:50,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 07:12:50,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753152194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:12:50,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 07:12:50,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 07:12:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363120113] [2022-12-14 07:12:50,173 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 07:12:50,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 07:12:50,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 07:12:50,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=549, Unknown=11, NotChecked=0, Total=650 [2022-12-14 07:12:50,175 INFO L87 Difference]: Start difference. First operand 1119 states and 1360 transitions. Second operand has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:12:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:59,466 INFO L93 Difference]: Finished difference Result 1146 states and 1394 transitions. [2022-12-14 07:12:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 07:12:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-12-14 07:12:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:59,470 INFO L225 Difference]: With dead ends: 1146 [2022-12-14 07:12:59,470 INFO L226 Difference]: Without dead ends: 1142 [2022-12-14 07:12:59,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=2790, Unknown=38, NotChecked=0, Total=3306 [2022-12-14 07:12:59,471 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 1751 mSDsluCounter, 5522 mSDsCounter, 0 mSdLazyCounter, 7073 mSolverCounterSat, 44 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 5990 SdHoareTripleChecker+Invalid, 7125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 7073 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:59,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 5990 Invalid, 7125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 7073 Invalid, 8 Unknown, 0 Unchecked, 8.1s Time] [2022-12-14 07:12:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-12-14 07:12:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1127. [2022-12-14 07:12:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 737 states have (on average 1.7991858887381276) internal successors, (1326), 1115 states have internal predecessors, (1326), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:12:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1371 transitions. [2022-12-14 07:12:59,483 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1371 transitions. Word has length 77 [2022-12-14 07:12:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:59,484 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1371 transitions. [2022-12-14 07:12:59,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:12:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1371 transitions. [2022-12-14 07:12:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 07:12:59,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:59,484 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:59,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-12-14 07:12:59,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Forceful destruction successful, exit code 0 [2022-12-14 07:12:59,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 07:13:00,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:13:00,087 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:13:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 590103405, now seen corresponding path program 1 times [2022-12-14 07:13:00,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:00,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668754620] [2022-12-14 07:13:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:00,089 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-12-14 07:13:00,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:00,090 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:13:00,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:13:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:00,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:13:00,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:00,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:13:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:00,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:00,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668754620] [2022-12-14 07:13:00,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668754620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:13:00,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2103796150] [2022-12-14 07:13:00,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:13:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:13:00,885 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:13:00,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-12-14 07:13:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:01,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:13:01,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:01,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:13:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:01,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2103796150] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:13:01,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121697267] [2022-12-14 07:13:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:01,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:13:01,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:13:01,485 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:13:01,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 07:13:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:01,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 07:13:01,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:01,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:13:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:02,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121697267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:13:02,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 07:13:02,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 07:13:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252356162] [2022-12-14 07:13:02,461 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 07:13:02,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 07:13:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 07:13:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 07:13:02,463 INFO L87 Difference]: Start difference. First operand 1127 states and 1371 transitions. Second operand has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 38 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:13:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:05,045 INFO L93 Difference]: Finished difference Result 1169 states and 1428 transitions. [2022-12-14 07:13:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 07:13:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 38 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 83 [2022-12-14 07:13:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:05,049 INFO L225 Difference]: With dead ends: 1169 [2022-12-14 07:13:05,049 INFO L226 Difference]: Without dead ends: 1163 [2022-12-14 07:13:05,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 07:13:05,050 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 52 mSDsluCounter, 14389 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 15354 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:05,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 15354 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:13:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-12-14 07:13:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1145. [2022-12-14 07:13:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 755 states have (on average 1.7867549668874172) internal successors, (1349), 1133 states have internal predecessors, (1349), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:13:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1394 transitions. [2022-12-14 07:13:05,061 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1394 transitions. Word has length 83 [2022-12-14 07:13:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:05,061 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1394 transitions. [2022-12-14 07:13:05,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 38 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:13:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1394 transitions. [2022-12-14 07:13:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 07:13:05,062 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:05,062 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:05,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-12-14 07:13:05,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-14 07:13:05,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:13:05,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:13:05,664 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:13:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1945464365, now seen corresponding path program 2 times [2022-12-14 07:13:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:05,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974289494] [2022-12-14 07:13:05,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:13:05,668 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-12-14 07:13:05,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:05,669 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:13:05,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Waiting until timeout for monitored process [2022-12-14 07:13:06,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:13:06,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:13:06,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 07:13:06,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:06,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:13:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:08,152 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:08,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974289494] [2022-12-14 07:13:08,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974289494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:13:08,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1324160590] [2022-12-14 07:13:08,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:13:08,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:13:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:13:08,153 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:13:08,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-12-14 07:13:09,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:13:09,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:13:09,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 07:13:09,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:09,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:13:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:10,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1324160590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:13:10,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046291316] [2022-12-14 07:13:10,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:13:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:13:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:13:10,094 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:13:10,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 07:13:46,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:13:46,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:13:46,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 07:13:46,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:46,789 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-12-14 07:13:46,798 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:13:46,798 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-12-14 07:13:46,869 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-12-14 07:13:46,877 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-12-14 07:13:47,137 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-12-14 07:13:47,141 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-12-14 07:13:47,326 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2845))) (exists ((v_ArrVal_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:13:47,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848)))) is different from true [2022-12-14 07:13:47,436 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-12-14 07:13:47,445 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:13:47,454 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855))) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:13:47,462 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858)))) is different from true [2022-12-14 07:13:47,470 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:13:47,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861)))) is different from true [2022-12-14 07:13:47,489 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863)))) is different from true [2022-12-14 07:13:47,498 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:13:47,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:13:47,599 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871)))) is different from true [2022-12-14 07:13:47,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874)))) is different from true [2022-12-14 07:13:47,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2876))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2875)))) is different from true [2022-12-14 07:13:47,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877)))) is different from true [2022-12-14 07:13:47,631 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:13:47,639 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2881))) (exists ((v_ArrVal_2882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2882)))) is different from true [2022-12-14 07:13:47,647 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883)))) is different from true [2022-12-14 07:13:47,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2886) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2885)))) is different from true [2022-12-14 07:13:47,684 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:13:47,684 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-12-14 07:13:47,696 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-12-14 07:13:47,832 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-12-14 07:13:47,837 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-12-14 07:13:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 247 not checked. [2022-12-14 07:13:47,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:13:48,506 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2933 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2934) |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~mem38#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2934 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-14 07:13:48,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046291316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:13:48,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 07:13:48,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 28] total 77 [2022-12-14 07:13:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579679850] [2022-12-14 07:13:48,512 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 07:13:48,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-14 07:13:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-14 07:13:48,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2839, Unknown=45, NotChecked=2700, Total=6320 [2022-12-14 07:13:48,514 INFO L87 Difference]: Start difference. First operand 1145 states and 1394 transitions. Second operand has 77 states, 76 states have (on average 2.5789473684210527) internal successors, (196), 77 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:14:14,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2876))) (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2881))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848))) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2886) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_ArrVal_2885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2885))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855))) (exists ((v_ArrVal_2875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2875))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2845))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_2882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2882))) (exists ((v_ArrVal_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861))) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:14:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:48,918 INFO L93 Difference]: Finished difference Result 2106 states and 2609 transitions. [2022-12-14 07:14:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-12-14 07:14:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.5789473684210527) internal successors, (196), 77 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2022-12-14 07:14:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:48,924 INFO L225 Difference]: With dead ends: 2106 [2022-12-14 07:14:48,924 INFO L226 Difference]: Without dead ends: 2094 [2022-12-14 07:14:48,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 394 SyntacticMatches, 3 SemanticMatches, 181 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 4797 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=3928, Invalid=22087, Unknown=151, NotChecked=7140, Total=33306 [2022-12-14 07:14:48,933 INFO L413 NwaCegarLoop]: 855 mSDtfsCounter, 1943 mSDsluCounter, 24162 mSDsCounter, 0 mSdLazyCounter, 26210 mSolverCounterSat, 122 mSolverCounterUnsat, 794 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 25017 SdHoareTripleChecker+Invalid, 58174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 26210 IncrementalHoareTripleChecker+Invalid, 794 IncrementalHoareTripleChecker+Unknown, 31048 IncrementalHoareTripleChecker+Unchecked, 35.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:48,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 25017 Invalid, 58174 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [122 Valid, 26210 Invalid, 794 Unknown, 31048 Unchecked, 35.7s Time] [2022-12-14 07:14:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-12-14 07:14:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1178. [2022-12-14 07:14:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 789 states have (on average 1.761723700887199) internal successors, (1390), 1166 states have internal predecessors, (1390), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:14:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1435 transitions. [2022-12-14 07:14:48,960 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1435 transitions. Word has length 95 [2022-12-14 07:14:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:48,960 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1435 transitions. [2022-12-14 07:14:48,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.5789473684210527) internal successors, (196), 77 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:14:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1435 transitions. [2022-12-14 07:14:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 07:14:48,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:48,962 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:14:48,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 07:14:49,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-12-14 07:14:49,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 07:14:49,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:14:49,564 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:14:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1053460856, now seen corresponding path program 1 times [2022-12-14 07:14:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:49,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434456111] [2022-12-14 07:14:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:49,567 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-12-14 07:14:49,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:49,568 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:14:49,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-12-14 07:14:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:50,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 07:14:50,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:50,267 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-12-14 07:14:50,344 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:14:50,344 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-12-14 07:14:50,363 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-12-14 07:14:50,443 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-12-14 07:14:51,601 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:14:51,602 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-12-14 07:14:51,673 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:14:51,674 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-12-14 07:14:51,688 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-12-14 07:14:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 07:14:51,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:53,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:14:54,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3404))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:14:54,018 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434456111] [2022-12-14 07:14:54,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434456111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:14:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1460132557] [2022-12-14 07:14:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:54,018 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:14:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:14:54,019 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:14:54,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-12-14 07:14:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:57,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 07:14:57,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:57,139 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-12-14 07:14:57,237 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:14:57,237 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-12-14 07:14:57,250 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-12-14 07:14:57,296 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-12-14 07:14:57,677 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (and (not (= v_arrayElimCell_30 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_30))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3796) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:14:58,376 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (and (not (= v_arrayElimCell_30 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_30))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3823)))) is different from true [2022-12-14 07:14:58,535 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:14:58,536 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-12-14 07:14:58,596 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:14:58,596 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-12-14 07:14:58,616 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-12-14 07:14:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-12-14 07:14:58,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:00,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3874 (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~mem38#1.base| v_ArrVal_3874))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 07:15:00,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1460132557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778462502] [2022-12-14 07:15:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:00,934 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:00,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 07:15:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:01,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 07:15:01,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:01,439 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:15:01,439 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-12-14 07:15:01,468 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-12-14 07:15:03,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:03,177 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-12-14 07:15:03,299 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:03,299 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-12-14 07:15:03,320 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-12-14 07:15:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 07:15:03,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:05,649 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-12-14 07:15:05,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 07:15:05,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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~mem38#1.base| v_ArrVal_4342))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2022-12-14 07:15:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778462502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:05,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:15:05,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 21 [2022-12-14 07:15:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580509288] [2022-12-14 07:15:05,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:15:05,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 07:15:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:15:05,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 07:15:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=377, Unknown=27, NotChecked=270, Total=756 [2022-12-14 07:15:05,662 INFO L87 Difference]: Start difference. First operand 1178 states and 1435 transitions. Second operand has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 21 states have internal predecessors, (128), 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-12-14 07:15:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:20,937 INFO L93 Difference]: Finished difference Result 1186 states and 1443 transitions. [2022-12-14 07:15:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:15:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 21 states have internal predecessors, (128), 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 120 [2022-12-14 07:15:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:20,940 INFO L225 Difference]: With dead ends: 1186 [2022-12-14 07:15:20,940 INFO L226 Difference]: Without dead ends: 1186 [2022-12-14 07:15:20,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 220 SyntacticMatches, 134 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=169, Invalid=809, Unknown=38, NotChecked=390, Total=1406 [2022-12-14 07:15:20,941 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 1692 mSDsluCounter, 5421 mSDsCounter, 0 mSdLazyCounter, 6930 mSolverCounterSat, 25 mSolverCounterUnsat, 880 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 5888 SdHoareTripleChecker+Invalid, 9779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6930 IncrementalHoareTripleChecker+Invalid, 880 IncrementalHoareTripleChecker+Unknown, 1944 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:20,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 5888 Invalid, 9779 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6930 Invalid, 880 Unknown, 1944 Unchecked, 14.7s Time] [2022-12-14 07:15:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-12-14 07:15:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1177. [2022-12-14 07:15:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 789 states have (on average 1.7604562737642586) internal successors, (1389), 1165 states have internal predecessors, (1389), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:15:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1434 transitions. [2022-12-14 07:15:20,951 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1434 transitions. Word has length 120 [2022-12-14 07:15:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:20,951 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1434 transitions. [2022-12-14 07:15:20,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 21 states have internal predecessors, (128), 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-12-14 07:15:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1434 transitions. [2022-12-14 07:15:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 07:15:20,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:20,952 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:20,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 07:15:21,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-12-14 07:15:21,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2022-12-14 07:15:21,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:15:21,555 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:15:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1053460857, now seen corresponding path program 1 times [2022-12-14 07:15:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:15:21,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97036778] [2022-12-14 07:15:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:21,559 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-12-14 07:15:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:15:21,562 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:15:21,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-12-14 07:15:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:22,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 07:15:22,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:22,291 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-12-14 07:15:22,391 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-12-14 07:15:22,402 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:15:22,402 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-12-14 07:15:22,420 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-12-14 07:15:22,428 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-12-14 07:15:22,517 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-12-14 07:15:22,522 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-12-14 07:15:22,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,581 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,635 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,644 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:22,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,666 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,721 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,732 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,744 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,755 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,767 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,777 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,788 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,802 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,812 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,821 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:22,830 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:15:22,839 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,859 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,898 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,907 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:22,917 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785)))) is different from true [2022-12-14 07:15:22,926 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,939 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4789))) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,951 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4790) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:22,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,012 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4801))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,024 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4802))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4808) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,064 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:15:23,099 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:23,100 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-12-14 07:15:23,108 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-12-14 07:15:23,212 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:23,213 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-12-14 07:15:23,224 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-12-14 07:15:23,242 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-12-14 07:15:23,248 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-12-14 07:15:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-12-14 07:15:23,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:23,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 07:15:23,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 07:15:24,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4904) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4905))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4904) .cse2 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 07:15:24,211 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:15:24,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97036778] [2022-12-14 07:15:24,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97036778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:24,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1224348276] [2022-12-14 07:15:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:24,212 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:15:24,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:15:24,212 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:15:24,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-12-14 07:17:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:25,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 07:17:25,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:25,829 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-12-14 07:17:25,918 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:17:25,918 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-12-14 07:17:25,923 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-12-14 07:17:25,934 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-12-14 07:17:25,945 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-12-14 07:17:25,994 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-12-14 07:17:25,999 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-12-14 07:17:26,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,074 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292)))) is different from true [2022-12-14 07:17:26,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:26,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,151 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309)))) is different from true [2022-12-14 07:17:26,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,214 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322)))) is different from true [2022-12-14 07:17:26,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325))) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,294 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,340 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5342) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,350 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344))) (exists ((v_ArrVal_5343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5343))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,359 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346)))) is different from true [2022-12-14 07:17:26,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,379 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,389 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,399 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354)))) is different from true [2022-12-14 07:17:26,409 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356)))) is different from true [2022-12-14 07:17:26,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360)))) is different from true [2022-12-14 07:17:26,437 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5362))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5363))) (exists ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5364))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,458 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5366) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5365) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,468 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5367) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5368) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,480 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5369))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5370) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:17:26,492 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5372) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5371))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,503 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5373))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:26,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:26,548 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-12-14 07:17:26,560 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-12-14 07:17:26,624 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:26,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:17:26,633 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-12-14 07:17:26,658 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-12-14 07:17:26,665 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-12-14 07:17:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 07:17:26,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:26,727 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5375) |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~mem40#1.base| v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 07:17:26,758 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 07:17:27,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5468) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5467))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5468) .cse2 v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 07:17:27,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1224348276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:27,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363821322] [2022-12-14 07:17:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:27,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:17:27,505 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:17:27,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 07:17:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:28,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 07:17:28,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:28,145 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-12-14 07:17:28,161 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:17:28,161 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-12-14 07:17:28,168 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-12-14 07:17:28,177 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-12-14 07:17:28,225 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-12-14 07:17:28,231 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-12-14 07:17:28,274 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 07:17:28,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5851))) (exists ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5852))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,304 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5856))) (exists ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5855) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5857))) (exists ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5858))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,323 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,337 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:17:28,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866)))) is different from true [2022-12-14 07:17:28,364 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868)))) is different from true [2022-12-14 07:17:28,373 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:28,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5871))) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,391 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5874))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5875))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876)))) is different from true [2022-12-14 07:17:28,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5877 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5877) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,417 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880))) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,436 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883)))) is different from true [2022-12-14 07:17:28,445 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5886))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5885)))) is different from true [2022-12-14 07:17:28,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,466 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,476 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5892))) (exists ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5891))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,485 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5893) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5894))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,496 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5895))) (exists ((v_ArrVal_5896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5896))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,505 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5897) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5898))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5899))) (exists ((v_ArrVal_5900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5900) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,525 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5902))) (exists ((v_ArrVal_5901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5901))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,535 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5904) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5903 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5903) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,545 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5905) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5906))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,555 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5908))) (exists ((v_ArrVal_5907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5907))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5909) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5910))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,576 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5911))) (exists ((v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5912) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5914))) (exists ((v_ArrVal_5913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5913))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,599 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5916))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5915)))) is different from true [2022-12-14 07:17:28,610 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5917))) (exists ((v_ArrVal_5918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5918))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5920))) (exists ((v_ArrVal_5919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5919))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5921))) (exists ((v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5922))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5924) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5923) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5926))) (exists ((v_ArrVal_5925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5925))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,674 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5928))) (exists ((v_ArrVal_5927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5927))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,691 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5930) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5929) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5931 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5931) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5932))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,715 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5933))) (exists ((v_ArrVal_5934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5934))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,726 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5936) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5935))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-12-14 07:17:28,766 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:28,766 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-12-14 07:17:28,780 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-12-14 07:17:28,850 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:28,851 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-12-14 07:17:28,861 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-12-14 07:17:28,883 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-12-14 07:17:28,890 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-12-14 07:17:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 07:17:28,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:28,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 07:17:28,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 07:17:29,788 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6029))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6030) .cse0 v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6030) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-12-14 07:17:29,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363821322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:29,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:17:29,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52, 53] total 140 [2022-12-14 07:17:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483777879] [2022-12-14 07:17:29,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:17:29,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2022-12-14 07:17:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:17:29,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2022-12-14 07:17:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=259, Unknown=146, NotChecked=22240, Total=22952 [2022-12-14 07:17:29,806 INFO L87 Difference]: Start difference. First operand 1177 states and 1434 transitions. Second operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 141 states have internal predecessors, (240), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:17:30,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731))) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 07:17:30,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:17:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:17:38,329 INFO L93 Difference]: Finished difference Result 1194 states and 1452 transitions. [2022-12-14 07:17:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:17:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 141 states have internal predecessors, (240), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2022-12-14 07:17:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:17:38,333 INFO L225 Difference]: With dead ends: 1194 [2022-12-14 07:17:38,333 INFO L226 Difference]: Without dead ends: 1194 [2022-12-14 07:17:38,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 223 SyntacticMatches, 8 SemanticMatches, 160 ConstructedPredicates, 141 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=374, Invalid=455, Unknown=155, NotChecked=25098, Total=26082 [2022-12-14 07:17:38,337 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 1658 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 23 mSolverCounterUnsat, 436 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 131111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 436 IncrementalHoareTripleChecker+Unknown, 127399 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:17:38,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 2341 Invalid, 131111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3253 Invalid, 436 Unknown, 127399 Unchecked, 7.9s Time] [2022-12-14 07:17:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-12-14 07:17:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1186. [2022-12-14 07:17:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 797 states have (on average 1.754077791718946) internal successors, (1398), 1173 states have internal predecessors, (1398), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (24), 9 states have call predecessors, (24), 22 states have call successors, (24) [2022-12-14 07:17:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1444 transitions. [2022-12-14 07:17:38,350 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1444 transitions. Word has length 120 [2022-12-14 07:17:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:17:38,350 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1444 transitions. [2022-12-14 07:17:38,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 141 states have internal predecessors, (240), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:17:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1444 transitions. [2022-12-14 07:17:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 07:17:38,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:17:38,354 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 07:17:38,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-12-14 07:17:38,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-14 07:17:38,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-12-14 07:17:38,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:17:38,956 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:17:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:17:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 701502272, now seen corresponding path program 2 times [2022-12-14 07:17:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:17:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039390985] [2022-12-14 07:17:38,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:17:38,960 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-12-14 07:17:38,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:17:38,961 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:17:38,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-12-14 07:17:39,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:17:39,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:17:39,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:17:39,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:17:40,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:17:47,799 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:17:47,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039390985] [2022-12-14 07:17:47,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039390985] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:17:47,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [791274679] [2022-12-14 07:17:47,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:17:47,799 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:17:47,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:17:47,800 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:17:47,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-12-14 07:17:49,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:17:49,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:17:49,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:17:49,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:17:50,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:17:51,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [791274679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:17:51,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785231726] [2022-12-14 07:17:51,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:17:51,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:51,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:17:51,311 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:17:51,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 07:18:19,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:18:19,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:18:19,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 07:18:19,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:18:19,833 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-12-14 07:18:20,513 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:18:20,513 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-12-14 07:18:20,519 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-12-14 07:18:20,687 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-12-14 07:18:20,693 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-12-14 07:18:20,966 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-12-14 07:18:21,156 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-12-14 07:18:22,196 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv40 32))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185)))) is different from true [2022-12-14 07:18:22,202 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv40 32))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186)))) is different from true [2022-12-14 07:18:24,467 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv40 32))) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200)))) is different from true [2022-12-14 07:18:25,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv40 32))) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:25,223 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv40 32))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:28,792 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-12-14 07:18:29,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:29,269 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 84 treesize of output 62 [2022-12-14 07:18:29,285 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-12-14 07:18:29,286 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 102 treesize of output 68 [2022-12-14 07:18:29,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:18:29,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-12-14 07:18:29,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:18:29,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 07:18:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 215 not checked. [2022-12-14 07:18:29,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:18:32,304 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 239 treesize of output 167 [2022-12-14 07:19:49,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785231726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:49,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 07:19:49,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48, 48, 18] total 111 [2022-12-14 07:19:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850639366] [2022-12-14 07:19:49,579 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:49,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-12-14 07:19:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:19:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-12-14 07:19:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1377, Invalid=10769, Unknown=84, NotChecked=1110, Total=13340 [2022-12-14 07:19:49,583 INFO L87 Difference]: Start difference. First operand 1186 states and 1444 transitions. Second operand has 111 states, 110 states have (on average 2.2454545454545456) internal successors, (247), 111 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:25:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:25:30,594 INFO L93 Difference]: Finished difference Result 1341 states and 1619 transitions. [2022-12-14 07:25:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-12-14 07:25:30,595 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 2.2454545454545456) internal successors, (247), 111 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 121 [2022-12-14 07:25:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:25:30,598 INFO L225 Difference]: With dead ends: 1341 [2022-12-14 07:25:30,598 INFO L226 Difference]: Without dead ends: 1335 [2022-12-14 07:25:30,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 457 SyntacticMatches, 82 SemanticMatches, 262 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 19641 ImplicationChecksByTransitivity, 181.9s TimeCoverageRelationStatistics Valid=7538, Invalid=59202, Unknown=102, NotChecked=2590, Total=69432 [2022-12-14 07:25:30,603 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 2737 mSDsluCounter, 15066 mSDsCounter, 0 mSdLazyCounter, 47176 mSolverCounterSat, 245 mSolverCounterUnsat, 1006 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 234.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 15359 SdHoareTripleChecker+Invalid, 53920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.5s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 47176 IncrementalHoareTripleChecker+Invalid, 1006 IncrementalHoareTripleChecker+Unknown, 5493 IncrementalHoareTripleChecker+Unchecked, 252.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:25:30,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 15359 Invalid, 53920 Unknown, 0 Unchecked, 0.5s Time], IncrementalHoareTripleChecker [245 Valid, 47176 Invalid, 1006 Unknown, 5493 Unchecked, 252.2s Time] [2022-12-14 07:25:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-12-14 07:25:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1244. [2022-12-14 07:25:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 857 states have (on average 1.7222870478413068) internal successors, (1476), 1231 states have internal predecessors, (1476), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-12-14 07:25:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1521 transitions. [2022-12-14 07:25:30,619 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1521 transitions. Word has length 121 [2022-12-14 07:25:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:25:30,619 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1521 transitions. [2022-12-14 07:25:30,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 2.2454545454545456) internal successors, (247), 111 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:25:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1521 transitions. [2022-12-14 07:25:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 07:25:30,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:25:30,620 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:25:30,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-12-14 07:25:30,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 07:25:31,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2022-12-14 07:25:31,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:25:31,222 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-12-14 07:25:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:25:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 326718515, now seen corresponding path program 1 times [2022-12-14 07:25:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:25:31,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838474173] [2022-12-14 07:25:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:25:31,227 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-12-14 07:25:31,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:25:31,230 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 07:25:31,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-12-14 07:25:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:25:32,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 07:25:32,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:25:32,106 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-12-14 07:25:32,751 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:25:32,751 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-12-14 07:25:32,857 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-12-14 07:25:33,177 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-12-14 07:25:37,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:25:37,600 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-12-14 07:25:37,912 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:25:37,912 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-12-14 07:25:38,200 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:25:38,200 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-12-14 07:25:38,268 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-12-14 07:25:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 07:25:38,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:25:39,475 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:25:39,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7714))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7715)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:25:39,563 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7714))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7715)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 07:25:40,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7761))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7714)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7715)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 07:25:40,237 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:25:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838474173] [2022-12-14 07:25:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838474173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:25:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1347974046] [2022-12-14 07:25:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:25:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:25:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:25:40,239 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:25:40,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-12-14 07:26:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:04,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 07:26:04,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:04,255 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-12-14 07:26:04,857 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:26:04,857 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-12-14 07:26:04,911 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-12-14 07:26:05,084 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-12-14 07:26:06,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:07,241 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:07,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:09,417 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:26:09,417 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-12-14 07:26:09,635 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:26:09,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 36 treesize of output 37 [2022-12-14 07:26:09,774 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:26:09,774 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-12-14 07:26:09,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 07:26:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-12-14 07:26:09,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:09,901 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8201) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-14 07:26:09,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8201 (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_8201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 07:26:09,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8200))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8201)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:26:10,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8200))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8201)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 07:26:10,670 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8200 (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~mem38#1.base| v_ArrVal_8247))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8200)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8201)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 07:26:10,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1347974046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:10,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474844833] [2022-12-14 07:26:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:10,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:10,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:10,679 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:10,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b612372-d047-4f7e-9bd9-ddf06a893637/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 07:26:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:11,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:26:11,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:11,764 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:26:11,764 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-12-14 07:26:11,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-12-14 07:26:12,376 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8640) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,396 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8641))) is different from true [2022-12-14 07:26:12,415 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8642))) is different from true [2022-12-14 07:26:12,436 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8643))) is different from true [2022-12-14 07:26:12,456 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8644) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,476 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8645 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8645))) is different from true [2022-12-14 07:26:12,497 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8646))) is different from true [2022-12-14 07:26:12,518 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8647))) is different from true [2022-12-14 07:26:12,538 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8648) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,558 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8649))) is different from true [2022-12-14 07:26:12,577 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8650 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8650))) is different from true [2022-12-14 07:26:12,597 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8651) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,617 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8652))) is different from true [2022-12-14 07:26:12,637 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8653))) is different from true [2022-12-14 07:26:12,658 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8654 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8654))) is different from true [2022-12-14 07:26:12,679 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8655 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8655))) is different from true [2022-12-14 07:26:12,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8656))) is different from true [2022-12-14 07:26:12,720 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8657) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,741 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8658) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,760 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8659))) is different from true [2022-12-14 07:26:12,781 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8660))) is different from true [2022-12-14 07:26:12,801 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8661))) is different from true [2022-12-14 07:26:12,821 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8662))) is different from true [2022-12-14 07:26:12,840 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8663) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,861 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8664))) is different from true [2022-12-14 07:26:12,882 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8665) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,903 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8666))) is different from true [2022-12-14 07:26:12,924 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8667) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:12,944 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8668))) is different from true [2022-12-14 07:26:12,964 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8669))) is different from true [2022-12-14 07:26:12,985 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8670))) is different from true [2022-12-14 07:26:13,006 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8671) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:13,028 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8672) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:13,049 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8673) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:13,069 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8674))) is different from true [2022-12-14 07:26:13,090 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8675))) is different from true [2022-12-14 07:26:13,110 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8676))) is different from true [2022-12-14 07:26:13,128 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8677) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:13,145 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8678) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:13,160 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8679))) is different from true [2022-12-14 07:26:13,176 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8680 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8680))) is different from true [2022-12-14 07:26:13,191 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8681 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8681))) is different from true [2022-12-14 07:26:13,206 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8682 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8682))) is different from true [2022-12-14 07:26:13,222 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8683 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8683) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:26:13,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:26:13,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 07:26:13,499 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:26:13,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 07:26:13,743 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:26:13,744 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-12-14 07:26:13,985 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-12-14 07:26:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 07:26:13,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:14,078 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 07:26:14,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 07:26:14,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8685 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8685) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem41#1.base|)) is different from false [2022-12-14 07:26:14,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8685 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-12-14 07:26:14,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8684)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-12-14 07:26:14,200 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8684))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-12-14 07:26:14,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8731))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8684)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-12-14 07:26:14,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474844833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:14,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:14,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 55] total 66 [2022-12-14 07:26:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25904116] [2022-12-14 07:26:14,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-14 07:26:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:26:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-14 07:26:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=429, Unknown=81, NotChecked=6100, Total=6806 [2022-12-14 07:26:14,828 INFO L87 Difference]: Start difference. First operand 1244 states and 1521 transitions. Second operand has 67 states, 64 states have (on average 2.78125) internal successors, (178), 67 states have internal predecessors, (178), 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-12-14 07:26:17,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8640) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670)))) is different from true [2022-12-14 07:26:17,845 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8641))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:17,856 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8642))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:17,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8643))) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:17,966 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8645 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8645))) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:17,976 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8646))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:17,986 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8647 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8647))) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:17,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8648) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:18,007 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8649))) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:18,018 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8650 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8650))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:18,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8651) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:18,039 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8652))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:26:18,050 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8653 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8653))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_arrayElimCell_92 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_92) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= v_arrayElimCell_92 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_8178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8171) |c_#memory_$Pointer$.base|))) is different from true