./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.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_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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_3c12862e-56d9-497a-88bf-696f8b6a987d/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 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f --- 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 08:23:33,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:23:33,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:23:33,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:23:33,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:23:33,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:23:33,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:23:33,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:23:33,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:23:33,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:23:33,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:23:33,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:23:33,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:23:33,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:23:33,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:23:33,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:23:33,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:23:33,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:23:33,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:23:33,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:23:33,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:23:33,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:23:33,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:23:33,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:23:33,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:23:33,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:23:33,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:23:33,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:23:33,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:23:33,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:23:33,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:23:33,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:23:33,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:23:33,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:23:33,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:23:33,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:23:33,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:23:33,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:23:33,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:23:33,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:23:33,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:23:33,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 08:23:33,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:23:33,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:23:33,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:23:33,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:23:33,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:23:33,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:23:33,945 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:23:33,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:23:33,945 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:23:33,945 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:23:33,945 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:23:33,946 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:23:33,946 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:23:33,946 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:23:33,946 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:23:33,946 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:23:33,946 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:23:33,947 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:23:33,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 08:23:33,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 08:23:33,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 08:23:33,948 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:23:33,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:23:33,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:23:33,949 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:23:33,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:23:33,950 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:23:33,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:23:33,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:23:33,950 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_3c12862e-56d9-497a-88bf-696f8b6a987d/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_3c12862e-56d9-497a-88bf-696f8b6a987d/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 -> 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f [2022-12-14 08:23:34,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:23:34,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:23:34,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:23:34,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:23:34,159 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:23:34,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2022-12-14 08:23:36,825 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:23:37,006 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:23:37,007 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2022-12-14 08:23:37,016 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data/ad05888de/44440602018442f5ae70f997d57128a7/FLAG0e13235d2 [2022-12-14 08:23:37,027 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data/ad05888de/44440602018442f5ae70f997d57128a7 [2022-12-14 08:23:37,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:23:37,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:23:37,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:23:37,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:23:37,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:23:37,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:23:37" (1/1) ... [2022-12-14 08:23:37,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49597730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:37, skipping insertion in model container [2022-12-14 08:23:37,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:23:37" (1/1) ... [2022-12-14 08:23:37,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:23:37,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:23:37,353 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[33021,33034] [2022-12-14 08:23:37,462 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 08:23:37,464 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[49681,49694] [2022-12-14 08:23:37,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:23:37,488 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 08:23:37,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26dc999a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:37, skipping insertion in model container [2022-12-14 08:23:37,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:23:37,489 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 08:23:37,491 INFO L158 Benchmark]: Toolchain (without parser) took 460.64ms. Allocated memory is still 113.2MB. Free memory was 77.2MB in the beginning and 54.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 08:23:37,491 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:23:37,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.08ms. Allocated memory is still 113.2MB. Free memory was 76.9MB in the beginning and 54.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 08:23:37,493 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.13ms. Allocated memory is still 113.2MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.08ms. Allocated memory is still 113.2MB. Free memory was 76.9MB in the beginning and 54.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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_3c12862e-56d9-497a-88bf-696f8b6a987d/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 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f --- 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 08:23:38,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:23:38,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:23:38,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:23:38,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:23:38,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:23:38,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:23:38,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:23:38,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:23:38,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:23:38,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:23:38,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:23:38,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:23:38,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:23:38,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:23:38,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:23:38,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:23:38,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:23:38,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:23:38,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:23:38,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:23:38,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:23:38,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:23:38,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:23:38,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:23:38,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:23:38,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:23:38,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:23:38,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:23:38,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:23:38,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:23:38,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:23:38,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:23:38,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:23:38,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:23:38,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:23:38,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:23:38,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:23:38,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:23:38,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:23:38,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:23:38,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 08:23:38,881 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:23:38,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:23:38,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:23:38,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:23:38,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:23:38,883 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:23:38,883 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:23:38,883 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:23:38,883 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:23:38,883 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:23:38,884 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:23:38,884 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:23:38,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 08:23:38,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:23:38,885 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:23:38,886 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:23:38,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:23:38,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 08:23:38,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:23:38,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:23:38,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:23:38,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:23:38,887 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 08:23:38,887 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 08:23:38,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:23:38,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 08:23:38,888 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_3c12862e-56d9-497a-88bf-696f8b6a987d/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_3c12862e-56d9-497a-88bf-696f8b6a987d/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 -> 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f [2022-12-14 08:23:39,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:23:39,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:23:39,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:23:39,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:23:39,125 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:23:39,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2022-12-14 08:23:41,683 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:23:41,907 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:23:41,908 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2022-12-14 08:23:41,919 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data/ff628e88f/533581348cf447999adbbcbf16a7693b/FLAGf301874a0 [2022-12-14 08:23:42,240 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/data/ff628e88f/533581348cf447999adbbcbf16a7693b [2022-12-14 08:23:42,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:23:42,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:23:42,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:23:42,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:23:42,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:23:42,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e83249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42, skipping insertion in model container [2022-12-14 08:23:42,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:23:42,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:23:42,560 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[33021,33034] [2022-12-14 08:23:42,643 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 08:23:42,645 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[49681,49694] [2022-12-14 08:23:42,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:23:42,664 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 08:23:42,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:23:42,688 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[33021,33034] [2022-12-14 08:23:42,733 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 08:23:42,735 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[49681,49694] [2022-12-14 08:23:42,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:23:42,744 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:23:42,768 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[33021,33034] [2022-12-14 08:23:42,822 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 08:23:42,824 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_3c12862e-56d9-497a-88bf-696f8b6a987d/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i[49681,49694] [2022-12-14 08:23:42,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:23:42,878 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:23:42,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42 WrapperNode [2022-12-14 08:23:42,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:23:42,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:23:42,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:23:42,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:23:42,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,977 INFO L138 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1570 [2022-12-14 08:23:42,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:23:42,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:23:42,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:23:42,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:23:42,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:42,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:43,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:43,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:43,064 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:43,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:43,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:23:43,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:23:43,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:23:43,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:23:43,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (1/1) ... [2022-12-14 08:23:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:23:43,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:23:43,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:23:43,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:23:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 08:23:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 08:23:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:23:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 08:23:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 08:23:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:23:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:23:43,350 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:23:43,352 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:23:43,356 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 08:23:48,346 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:23:48,355 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:23:48,355 INFO L300 CfgBuilder]: Removed 92 assume(true) statements. [2022-12-14 08:23:48,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:23:48 BoogieIcfgContainer [2022-12-14 08:23:48,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:23:48,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:23:48,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:23:48,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:23:48,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:23:42" (1/3) ... [2022-12-14 08:23:48,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6761fa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:23:48, skipping insertion in model container [2022-12-14 08:23:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:23:42" (2/3) ... [2022-12-14 08:23:48,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6761fa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:23:48, skipping insertion in model container [2022-12-14 08:23:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:23:48" (3/3) ... [2022-12-14 08:23:48,364 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-2.i [2022-12-14 08:23:48,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:23:48,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 834 error locations. [2022-12-14 08:23:48,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:23:48,433 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;@3049c553, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:23:48,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 834 error locations. [2022-12-14 08:23:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 1653 states, 811 states have (on average 2.249075215782984) internal successors, (1824), 1644 states have internal predecessors, (1824), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 08:23:48,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:48,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 08:23:48,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-12-14 08:23:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:48,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047289864] [2022-12-14 08:23:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:48,456 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 08:23:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:48,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:48,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:48,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 08:23:48,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:48,586 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 08:23:48,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:48,587 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047289864] [2022-12-14 08:23:48,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047289864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:48,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:48,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:23:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752000842] [2022-12-14 08:23:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 08:23:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 08:23:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 08:23:48,617 INFO L87 Difference]: Start difference. First operand has 1653 states, 811 states have (on average 2.249075215782984) internal successors, (1824), 1644 states have internal predecessors, (1824), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:23:48,696 INFO L93 Difference]: Finished difference Result 1635 states and 1727 transitions. [2022-12-14 08:23:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 08:23:48,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 08:23:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:23:48,716 INFO L225 Difference]: With dead ends: 1635 [2022-12-14 08:23:48,717 INFO L226 Difference]: Without dead ends: 1633 [2022-12-14 08:23:48,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 08:23:48,720 INFO L413 NwaCegarLoop]: 1727 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:23:48,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:23:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-12-14 08:23:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2022-12-14 08:23:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 802 states have (on average 2.123441396508728) internal successors, (1703), 1624 states have internal predecessors, (1703), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1725 transitions. [2022-12-14 08:23:48,782 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1725 transitions. Word has length 5 [2022-12-14 08:23:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:23:48,783 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 1725 transitions. [2022-12-14 08:23:48,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1725 transitions. [2022-12-14 08:23:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 08:23:48,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:48,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 08:23:48,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:48,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:48,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:48,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-12-14 08:23:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:48,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48941665] [2022-12-14 08:23:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:48,990 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 08:23:48,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:48,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:48,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:49,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:23:49,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:49,278 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 08:23:49,292 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 08:23:49,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:49,293 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48941665] [2022-12-14 08:23:49,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48941665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:49,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:49,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:23:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547374839] [2022-12-14 08:23:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:49,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:23:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:23:49,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:49,296 INFO L87 Difference]: Start difference. First operand 1633 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:23:51,856 INFO L93 Difference]: Finished difference Result 1889 states and 2024 transitions. [2022-12-14 08:23:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:23:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 08:23:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:23:51,860 INFO L225 Difference]: With dead ends: 1889 [2022-12-14 08:23:51,860 INFO L226 Difference]: Without dead ends: 1889 [2022-12-14 08:23:51,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:51,861 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1365 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:23:51,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1529 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 08:23:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-12-14 08:23:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1618. [2022-12-14 08:23:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 878 states have (on average 1.989749430523918) internal successors, (1747), 1609 states have internal predecessors, (1747), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1769 transitions. [2022-12-14 08:23:51,888 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1769 transitions. Word has length 5 [2022-12-14 08:23:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:23:51,889 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 1769 transitions. [2022-12-14 08:23:51,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1769 transitions. [2022-12-14 08:23:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 08:23:51,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:51,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 08:23:51,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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)] Forceful destruction successful, exit code 0 [2022-12-14 08:23:52,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:52,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-12-14 08:23:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212533660] [2022-12-14 08:23:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:52,096 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 08:23:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:52,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:52,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:52,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:23:52,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:52,228 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 08:23:52,246 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 08:23:52,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:52,247 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212533660] [2022-12-14 08:23:52,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212533660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:52,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:52,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:23:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852039542] [2022-12-14 08:23:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:52,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:23:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:23:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:52,249 INFO L87 Difference]: Start difference. First operand 1618 states and 1769 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:23:55,921 INFO L93 Difference]: Finished difference Result 2138 states and 2339 transitions. [2022-12-14 08:23:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:23:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 08:23:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:23:55,925 INFO L225 Difference]: With dead ends: 2138 [2022-12-14 08:23:55,925 INFO L226 Difference]: Without dead ends: 2138 [2022-12-14 08:23:55,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:55,926 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 741 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 08:23:55,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2260 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 08:23:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-12-14 08:23:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1774. [2022-12-14 08:23:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1044 states have (on average 1.9664750957854407) internal successors, (2053), 1765 states have internal predecessors, (2053), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2075 transitions. [2022-12-14 08:23:55,950 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2075 transitions. Word has length 5 [2022-12-14 08:23:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:23:55,950 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 2075 transitions. [2022-12-14 08:23:55,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2075 transitions. [2022-12-14 08:23:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 08:23:55,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:55,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 08:23:55,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-12-14 08:23:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:56,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167961686] [2022-12-14 08:23:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:56,152 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 08:23:56,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:56,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:56,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 08:23:56,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:56,256 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 08:23:56,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:56,256 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:56,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167961686] [2022-12-14 08:23:56,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167961686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:56,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:56,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:23:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944177936] [2022-12-14 08:23:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:56,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:23:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:23:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:56,258 INFO L87 Difference]: Start difference. First operand 1774 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:23:56,383 INFO L93 Difference]: Finished difference Result 3332 states and 3923 transitions. [2022-12-14 08:23:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:23:56,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 08:23:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:23:56,394 INFO L225 Difference]: With dead ends: 3332 [2022-12-14 08:23:56,394 INFO L226 Difference]: Without dead ends: 3332 [2022-12-14 08:23:56,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:56,395 INFO L413 NwaCegarLoop]: 1903 mSDtfsCounter, 1373 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:23:56,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 3517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:23:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2022-12-14 08:23:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 1776. [2022-12-14 08:23:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1046 states have (on average 1.9646271510516253) internal successors, (2055), 1767 states have internal predecessors, (2055), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2077 transitions. [2022-12-14 08:23:56,433 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2077 transitions. Word has length 6 [2022-12-14 08:23:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:23:56,433 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 2077 transitions. [2022-12-14 08:23:56,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2077 transitions. [2022-12-14 08:23:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 08:23:56,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:56,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:23:56,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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)] Forceful destruction successful, exit code 0 [2022-12-14 08:23:56,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-12-14 08:23:56,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:56,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548946609] [2022-12-14 08:23:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:56,636 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 08:23:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:56,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:56,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 08:23:56,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:56,752 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 08:23:56,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:56,752 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:56,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548946609] [2022-12-14 08:23:56,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548946609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:56,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:56,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:23:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186985970] [2022-12-14 08:23:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:56,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:23:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:23:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:56,754 INFO L87 Difference]: Start difference. First operand 1776 states and 2077 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:23:56,788 INFO L93 Difference]: Finished difference Result 1740 states and 2040 transitions. [2022-12-14 08:23:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:23:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 08:23:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:23:56,791 INFO L225 Difference]: With dead ends: 1740 [2022-12-14 08:23:56,792 INFO L226 Difference]: Without dead ends: 1740 [2022-12-14 08:23:56,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:23:56,792 INFO L413 NwaCegarLoop]: 1576 mSDtfsCounter, 1546 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1604 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 08:23:56,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1604 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:23:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2022-12-14 08:23:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1734. [2022-12-14 08:23:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1028 states have (on average 1.9571984435797665) internal successors, (2012), 1725 states have internal predecessors, (2012), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2034 transitions. [2022-12-14 08:23:56,823 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2034 transitions. Word has length 11 [2022-12-14 08:23:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:23:56,824 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 2034 transitions. [2022-12-14 08:23:56,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2034 transitions. [2022-12-14 08:23:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:23:56,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:56,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:23:56,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-12-14 08:23:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:57,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695736921] [2022-12-14 08:23:57,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:57,026 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 08:23:57,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:57,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:57,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:23:57,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:57,153 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 08:23:57,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:57,154 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:57,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695736921] [2022-12-14 08:23:57,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695736921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:57,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:57,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:23:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324607565] [2022-12-14 08:23:57,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:57,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:23:57,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:23:57,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:23:57,155 INFO L87 Difference]: Start difference. First operand 1734 states and 2034 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:23:57,238 INFO L93 Difference]: Finished difference Result 1719 states and 2012 transitions. [2022-12-14 08:23:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:23:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 08:23:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:23:57,244 INFO L225 Difference]: With dead ends: 1719 [2022-12-14 08:23:57,244 INFO L226 Difference]: Without dead ends: 1719 [2022-12-14 08:23:57,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:23:57,245 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 1527 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 3083 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 08:23:57,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 3083 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:23:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2022-12-14 08:23:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1712. [2022-12-14 08:23:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1020 states have (on average 1.9441176470588235) internal successors, (1983), 1703 states have internal predecessors, (1983), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:23:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2005 transitions. [2022-12-14 08:23:57,272 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2005 transitions. Word has length 13 [2022-12-14 08:23:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:23:57,273 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2005 transitions. [2022-12-14 08:23:57,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:23:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2005 transitions. [2022-12-14 08:23:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 08:23:57,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:23:57,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:23:57,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:23:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:23:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-12-14 08:23:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:23:57,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436171515] [2022-12-14 08:23:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:23:57,475 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 08:23:57,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:23:57,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:23:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:23:57,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:23:57,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:23:57,589 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 08:23:57,641 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 08:23:57,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:23:57,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:23:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436171515] [2022-12-14 08:23:57,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436171515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:23:57,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:23:57,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:23:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161396418] [2022-12-14 08:23:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:23:57,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:23:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:23:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:23:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:23:57,643 INFO L87 Difference]: Start difference. First operand 1712 states and 2005 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:01,252 INFO L93 Difference]: Finished difference Result 2756 states and 3086 transitions. [2022-12-14 08:24:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:24:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 08:24:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:01,260 INFO L225 Difference]: With dead ends: 2756 [2022-12-14 08:24:01,260 INFO L226 Difference]: Without dead ends: 2756 [2022-12-14 08:24:01,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:24:01,261 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 3196 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3204 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:01,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3204 Valid, 1880 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 08:24:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2022-12-14 08:24:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 1708. [2022-12-14 08:24:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1020 states have (on average 1.9401960784313725) internal successors, (1979), 1699 states have internal predecessors, (1979), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2001 transitions. [2022-12-14 08:24:01,288 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2001 transitions. Word has length 27 [2022-12-14 08:24:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:01,288 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 2001 transitions. [2022-12-14 08:24:01,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2001 transitions. [2022-12-14 08:24:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 08:24:01,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:01,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:01,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:01,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:01,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-12-14 08:24:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:01,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629637487] [2022-12-14 08:24:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:01,490 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 08:24:01,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:01,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:01,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:01,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 08:24:01,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:01,621 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 08:24:01,761 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 08:24:01,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:01,761 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629637487] [2022-12-14 08:24:01,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629637487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:01,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:01,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:24:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206929638] [2022-12-14 08:24:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:01,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:24:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:24:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:24:01,762 INFO L87 Difference]: Start difference. First operand 1708 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:06,199 INFO L93 Difference]: Finished difference Result 2276 states and 2479 transitions. [2022-12-14 08:24:06,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:24:06,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 08:24:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:06,203 INFO L225 Difference]: With dead ends: 2276 [2022-12-14 08:24:06,203 INFO L226 Difference]: Without dead ends: 2276 [2022-12-14 08:24:06,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:24:06,204 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1501 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:06,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 2591 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-12-14 08:24:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2022-12-14 08:24:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1704. [2022-12-14 08:24:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1020 states have (on average 1.9362745098039216) internal successors, (1975), 1695 states have internal predecessors, (1975), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1997 transitions. [2022-12-14 08:24:06,221 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1997 transitions. Word has length 27 [2022-12-14 08:24:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:06,221 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 1997 transitions. [2022-12-14 08:24:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1997 transitions. [2022-12-14 08:24:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 08:24:06,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:06,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:06,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-12-14 08:24:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:06,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325608639] [2022-12-14 08:24:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:06,425 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 08:24:06,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:06,427 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:06,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:24:06,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:06,672 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 08:24:06,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:06,672 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325608639] [2022-12-14 08:24:06,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325608639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:06,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:06,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:24:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938455530] [2022-12-14 08:24:06,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:06,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:24:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:06,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:24:06,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:24:06,674 INFO L87 Difference]: Start difference. First operand 1704 states and 1997 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:06,713 INFO L93 Difference]: Finished difference Result 1704 states and 1993 transitions. [2022-12-14 08:24:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:24:06,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-14 08:24:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:06,716 INFO L225 Difference]: With dead ends: 1704 [2022-12-14 08:24:06,716 INFO L226 Difference]: Without dead ends: 1704 [2022-12-14 08:24:06,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:24:06,717 INFO L413 NwaCegarLoop]: 1525 mSDtfsCounter, 1496 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 3061 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 08:24:06,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 3061 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:24:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2022-12-14 08:24:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1698. [2022-12-14 08:24:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1014 states have (on average 1.9378698224852071) internal successors, (1965), 1689 states have internal predecessors, (1965), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 1987 transitions. [2022-12-14 08:24:06,732 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 1987 transitions. Word has length 42 [2022-12-14 08:24:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:06,732 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 1987 transitions. [2022-12-14 08:24:06,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 1987 transitions. [2022-12-14 08:24:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 08:24:06,733 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:06,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:06,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-12-14 08:24:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:06,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535756790] [2022-12-14 08:24:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:06,938 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 08:24:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:06,941 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:06,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:07,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:24:07,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24: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 08:24:07,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:07,345 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:07,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535756790] [2022-12-14 08:24:07,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535756790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:07,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:07,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:24:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588874454] [2022-12-14 08:24:07,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:24:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:24:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:24:07,346 INFO L87 Difference]: Start difference. First operand 1698 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:07,529 INFO L93 Difference]: Finished difference Result 1939 states and 2237 transitions. [2022-12-14 08:24:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:24:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-12-14 08:24:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:07,535 INFO L225 Difference]: With dead ends: 1939 [2022-12-14 08:24:07,535 INFO L226 Difference]: Without dead ends: 1939 [2022-12-14 08:24:07,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:24:07,536 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 269 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:07,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 3004 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:24:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-12-14 08:24:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1744. [2022-12-14 08:24:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1060 states have (on average 1.8971698113207547) internal successors, (2011), 1735 states have internal predecessors, (2011), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2033 transitions. [2022-12-14 08:24:07,555 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2033 transitions. Word has length 50 [2022-12-14 08:24:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:07,556 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 2033 transitions. [2022-12-14 08:24:07,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2033 transitions. [2022-12-14 08:24:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 08:24:07,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:07,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:07,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:07,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:07,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-12-14 08:24:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:07,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666276955] [2022-12-14 08:24:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:07,762 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 08:24:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:07,765 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:07,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:08,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 08:24:08,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:08,064 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 08:24:08,071 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 08:24:08,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:24:08,424 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 08:24:08,434 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:24:08,435 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 08:24:08,451 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 08:24:08,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:08,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:08,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666276955] [2022-12-14 08:24:08,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666276955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:08,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:08,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:24:08,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466387664] [2022-12-14 08:24:08,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:08,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:24:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:24:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:24:08,453 INFO L87 Difference]: Start difference. First operand 1744 states and 2033 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:11,484 INFO L93 Difference]: Finished difference Result 1931 states and 2204 transitions. [2022-12-14 08:24:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:24:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-14 08:24:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:11,487 INFO L225 Difference]: With dead ends: 1931 [2022-12-14 08:24:11,487 INFO L226 Difference]: Without dead ends: 1931 [2022-12-14 08:24:11,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:24:11,488 INFO L413 NwaCegarLoop]: 627 mSDtfsCounter, 2660 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:11,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 920 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 08:24:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-12-14 08:24:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1494. [2022-12-14 08:24:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 894 states have (on average 1.8008948545861299) internal successors, (1610), 1485 states have internal predecessors, (1610), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1632 transitions. [2022-12-14 08:24:11,499 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1632 transitions. Word has length 53 [2022-12-14 08:24:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:11,500 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 1632 transitions. [2022-12-14 08:24:11,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1632 transitions. [2022-12-14 08:24:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 08:24:11,500 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:11,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:11,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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)] Forceful destruction successful, exit code 0 [2022-12-14 08:24:11,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:11,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-12-14 08:24:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:11,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465440074] [2022-12-14 08:24:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:11,705 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 08:24:11,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:11,707 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:11,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:11,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 08:24:11,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:11,965 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 08:24:11,975 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 08:24:12,000 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 08:24:12,008 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 08:24:12,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:12,008 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:12,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465440074] [2022-12-14 08:24:12,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465440074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:12,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:12,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:24:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834112910] [2022-12-14 08:24:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:12,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:24:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:24:12,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:24:12,010 INFO L87 Difference]: Start difference. First operand 1494 states and 1632 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:14,854 INFO L93 Difference]: Finished difference Result 1493 states and 1631 transitions. [2022-12-14 08:24:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:24:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 08:24:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:14,857 INFO L225 Difference]: With dead ends: 1493 [2022-12-14 08:24:14,857 INFO L226 Difference]: Without dead ends: 1493 [2022-12-14 08:24:14,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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 08:24:14,857 INFO L413 NwaCegarLoop]: 1445 mSDtfsCounter, 4 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:14,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3688 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 08:24:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2022-12-14 08:24:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2022-12-14 08:24:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 894 states have (on average 1.7997762863534676) internal successors, (1609), 1484 states have internal predecessors, (1609), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1631 transitions. [2022-12-14 08:24:14,876 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1631 transitions. Word has length 58 [2022-12-14 08:24:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:14,876 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1631 transitions. [2022-12-14 08:24:14,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1631 transitions. [2022-12-14 08:24:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 08:24:14,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:14,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, 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 08:24:14,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:15,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:15,078 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:15,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-12-14 08:24:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:15,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610272266] [2022-12-14 08:24:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:15,081 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 08:24:15,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:15,083 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:15,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:15,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 08:24:15,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:15,365 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 08:24:15,379 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 08:24:15,387 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 08:24:15,433 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 08:24:15,438 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 08:24:15,450 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 08:24:15,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:15,450 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:15,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610272266] [2022-12-14 08:24:15,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610272266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:15,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:15,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:24:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247316321] [2022-12-14 08:24:15,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:15,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:24:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:15,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:24:15,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:24:15,452 INFO L87 Difference]: Start difference. First operand 1493 states and 1631 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:19,785 INFO L93 Difference]: Finished difference Result 1492 states and 1630 transitions. [2022-12-14 08:24:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:24:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 08:24:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:19,789 INFO L225 Difference]: With dead ends: 1492 [2022-12-14 08:24:19,789 INFO L226 Difference]: Without dead ends: 1492 [2022-12-14 08:24:19,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:24:19,790 INFO L413 NwaCegarLoop]: 1445 mSDtfsCounter, 2 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:19,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3734 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-14 08:24:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-12-14 08:24:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2022-12-14 08:24:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 893 states have (on average 1.8006718924972005) internal successors, (1608), 1483 states have internal predecessors, (1608), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 08:24:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1630 transitions. [2022-12-14 08:24:19,803 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1630 transitions. Word has length 58 [2022-12-14 08:24:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:19,803 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 1630 transitions. [2022-12-14 08:24:19,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:24:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1630 transitions. [2022-12-14 08:24:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 08:24:19,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:19,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:19,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,005 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2065621890, now seen corresponding path program 1 times [2022-12-14 08:24:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:20,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490528532] [2022-12-14 08:24:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:20,008 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 08:24:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:20,009 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:20,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:24:20,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:20,363 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 08:24:20,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:24:20,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:20,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490528532] [2022-12-14 08:24:20,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490528532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:24:20,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:24:20,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:24:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650984728] [2022-12-14 08:24:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:24:20,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:24:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:20,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:24:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:24:20,365 INFO L87 Difference]: Start difference. First operand 1492 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 08:24:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:20,415 INFO L93 Difference]: Finished difference Result 1495 states and 1635 transitions. [2022-12-14 08:24:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:24:20,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-12-14 08:24:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:20,421 INFO L225 Difference]: With dead ends: 1495 [2022-12-14 08:24:20,421 INFO L226 Difference]: Without dead ends: 1495 [2022-12-14 08:24:20,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:24:20,422 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 2 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4324 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:20,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4324 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:24:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-12-14 08:24:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2022-12-14 08:24:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 895 states have (on average 1.8) internal successors, (1611), 1486 states have internal predecessors, (1611), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:24:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1635 transitions. [2022-12-14 08:24:20,436 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1635 transitions. Word has length 66 [2022-12-14 08:24:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:20,437 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 1635 transitions. [2022-12-14 08:24:20,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 08:24:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1635 transitions. [2022-12-14 08:24:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 08:24:20,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:20,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:20,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,638 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 611814351, now seen corresponding path program 1 times [2022-12-14 08:24:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:20,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291004213] [2022-12-14 08:24:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:20,642 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 08:24:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:20,644 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:20,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:21,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:24:21,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:21,054 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 08:24:21,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:21,110 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 08:24:21,110 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:21,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291004213] [2022-12-14 08:24:21,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291004213] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:21,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [566123762] [2022-12-14 08:24:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:21,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 08:24:21,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 08:24:21,112 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 08:24:21,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 08:24:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:21,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:24:21,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:21,447 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 08:24:21,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:21,478 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 08:24:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [566123762] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077777142] [2022-12-14 08:24:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:21,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:24:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:24:21,479 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:24:21,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 08:24:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:21,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:24:21,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:21,684 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 08:24:21,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:21,708 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 08:24:21,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077777142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:21,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 08:24:21,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 08:24:21,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292566959] [2022-12-14 08:24:21,709 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 08:24:21,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:24:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:24:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:24:21,710 INFO L87 Difference]: Start difference. First operand 1495 states and 1635 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:24:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:21,872 INFO L93 Difference]: Finished difference Result 1507 states and 1653 transitions. [2022-12-14 08:24:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 08:24:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-12-14 08:24:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:21,877 INFO L225 Difference]: With dead ends: 1507 [2022-12-14 08:24:21,877 INFO L226 Difference]: Without dead ends: 1507 [2022-12-14 08:24:21,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 08:24:21,877 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 12 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:21,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4326 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:24:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-12-14 08:24:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1505. [2022-12-14 08:24:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 904 states have (on average 1.7986725663716814) internal successors, (1626), 1495 states have internal predecessors, (1626), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:24:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1650 transitions. [2022-12-14 08:24:21,896 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1650 transitions. Word has length 67 [2022-12-14 08:24:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:21,896 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 1650 transitions. [2022-12-14 08:24:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:24:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1650 transitions. [2022-12-14 08:24:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 08:24:21,897 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:21,897 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:21,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 08:24:22,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-12-14 08:24:22,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:22,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:22,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -290789186, now seen corresponding path program 2 times [2022-12-14 08:24:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:22,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156321729] [2022-12-14 08:24:22,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 08:24:22,502 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 08:24:22,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:22,503 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:22,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (19)] Waiting until timeout for monitored process [2022-12-14 08:24:22,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 08:24:22,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:24:22,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 08:24:22,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:22,932 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 08:24:22,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:23,064 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 08:24:23,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:23,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156321729] [2022-12-14 08:24:23,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156321729] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:23,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [629236270] [2022-12-14 08:24:23,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 08:24:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 08:24:23,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 08:24:23,065 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 08:24:23,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-14 08:24:24,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 08:24:24,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:24:24,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 08:24:24,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:24,234 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 08:24:24,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:24,286 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 08:24:24,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [629236270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:24,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364889328] [2022-12-14 08:24:24,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 08:24:24,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:24:24,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:24:24,288 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:24:24,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 08:24:32,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 08:24:32,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:24:32,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 08:24:32,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:32,172 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:24:32,173 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 08:24:32,196 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 08:24:32,498 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:24:32,498 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 08:24:32,551 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 08:24:32,579 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 08:24:32,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:32,682 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 08:24:32,682 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 08:24:32,690 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-12-14 08:24:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364889328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:24:32,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 08:24:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 08:24:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447538388] [2022-12-14 08:24:32,692 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 08:24:32,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 08:24:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 08:24:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-12-14 08:24:32,694 INFO L87 Difference]: Start difference. First operand 1505 states and 1650 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 08:24:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:45,149 INFO L93 Difference]: Finished difference Result 1796 states and 1937 transitions. [2022-12-14 08:24:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 08:24:45,149 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-12-14 08:24:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:45,153 INFO L225 Difference]: With dead ends: 1796 [2022-12-14 08:24:45,153 INFO L226 Difference]: Without dead ends: 1792 [2022-12-14 08:24:45,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-12-14 08:24:45,155 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 2748 mSDsluCounter, 8581 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 105 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 9431 SdHoareTripleChecker+Invalid, 7903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2753 Valid, 9431 Invalid, 7903 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 7791 Invalid, 7 Unknown, 0 Unchecked, 11.0s Time] [2022-12-14 08:24:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2022-12-14 08:24:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1513. [2022-12-14 08:24:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 913 states have (on average 1.7929901423877328) internal successors, (1637), 1503 states have internal predecessors, (1637), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:24:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1661 transitions. [2022-12-14 08:24:45,173 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1661 transitions. Word has length 70 [2022-12-14 08:24:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:45,173 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 1661 transitions. [2022-12-14 08:24:45,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 08:24:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1661 transitions. [2022-12-14 08:24:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 08:24:45,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:45,174 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:45,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-12-14 08:24:45,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 08:24:45,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (19)] Ended with exit code 0 [2022-12-14 08:24:45,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:45,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1980129055, now seen corresponding path program 1 times [2022-12-14 08:24:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:45,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287972957] [2022-12-14 08:24:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:45,780 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 08:24:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:45,783 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:45,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (22)] Waiting until timeout for monitored process [2022-12-14 08:24:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:46,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 08:24:46,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:46,207 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 08:24:46,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:24:46,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:46,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287972957] [2022-12-14 08:24:46,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287972957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:46,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118511033] [2022-12-14 08:24:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:46,726 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 08:24:46,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 08:24:46,727 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 08:24:46,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-14 08:24:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:47,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 08:24:47,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:47,262 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 08:24:47,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:47,375 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 08:24:47,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2118511033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217873861] [2022-12-14 08:24:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:24:47,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:24:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:24:47,376 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:24:47,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 08:24:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:24:47,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 08:24:47,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:47,696 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 08:24:47,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:48,510 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 08:24:48,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217873861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:48,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 08:24:48,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 08:24:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480545747] [2022-12-14 08:24:48,511 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 08:24:48,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 08:24:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:24:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 08:24:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 08:24:48,512 INFO L87 Difference]: Start difference. First operand 1513 states and 1661 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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 08:24:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:24:51,504 INFO L93 Difference]: Finished difference Result 1555 states and 1727 transitions. [2022-12-14 08:24:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 08:24:51,504 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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 76 [2022-12-14 08:24:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:24:51,507 INFO L225 Difference]: With dead ends: 1555 [2022-12-14 08:24:51,507 INFO L226 Difference]: Without dead ends: 1549 [2022-12-14 08:24:51,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 08:24:51,509 INFO L413 NwaCegarLoop]: 1450 mSDtfsCounter, 51 mSDsluCounter, 23069 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 24519 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:24:51,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 24519 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 08:24:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2022-12-14 08:24:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1531. [2022-12-14 08:24:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 931 states have (on average 1.7830290010741139) internal successors, (1660), 1521 states have internal predecessors, (1660), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:24:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1684 transitions. [2022-12-14 08:24:51,529 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1684 transitions. Word has length 76 [2022-12-14 08:24:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:24:51,529 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 1684 transitions. [2022-12-14 08:24:51,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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 08:24:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1684 transitions. [2022-12-14 08:24:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 08:24:51,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:24:51,530 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:24:51,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-14 08:24:51,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-12-14 08:24:51,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (22)] Ended with exit code 0 [2022-12-14 08:24:52,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:52,133 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:24:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:24:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash -272337953, now seen corresponding path program 2 times [2022-12-14 08:24:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:24:52,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581129800] [2022-12-14 08:24:52,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 08:24:52,136 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 08:24:52,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:24:52,138 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:24:52,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (25)] Waiting until timeout for monitored process [2022-12-14 08:24:52,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 08:24:52,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:24:52,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 08:24:52,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:53,087 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 08:24:53,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:56,087 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 08:24:56,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:24:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581129800] [2022-12-14 08:24:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581129800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [444070597] [2022-12-14 08:24:56,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 08:24:56,088 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 08:24:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 08:24:56,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 08:24:56,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-12-14 08:24:57,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 08:24:57,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:24:57,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 08:24:57,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:24:57,770 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 08:24:57,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:24:58,560 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 08:24:58,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [444070597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:24:58,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889581268] [2022-12-14 08:24:58,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 08:24:58,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:24:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:24:58,561 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:24:58,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 08:25:08,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 08:25:08,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:25:08,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 08:25:08,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:25:08,922 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:25:08,923 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 08:25:08,928 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 08:25:09,018 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 08:25:09,026 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 08:25:09,317 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 08:25:09,321 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 08:25:09,443 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:25:09,552 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:25:09,739 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 08:25:09,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436)))) is different from true [2022-12-14 08:25:09,754 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2437) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2438))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 08:25:09,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 08:25:09,770 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:25:10,005 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447)))) is different from true [2022-12-14 08:25:10,013 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449)))) is different from true [2022-12-14 08:25:10,021 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:25:10,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 08:25:10,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-12-14 08:25:10,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-12-14 08:25:10,062 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:25:10,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:25:10,082 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-12-14 08:25:10,092 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:25:10,130 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:25:10,130 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 08:25:10,136 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 08:25:10,308 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 08:25:10,314 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 08:25:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 238 not checked. [2022-12-14 08:25:10,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:25:11,165 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 08:25:11,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889581268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:25:11,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 08:25:11,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 26] total 75 [2022-12-14 08:25:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707657689] [2022-12-14 08:25:11,170 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 08:25:11,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-14 08:25:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:25:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-14 08:25:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2843, Unknown=37, NotChecked=2394, Total=6006 [2022-12-14 08:25:11,173 INFO L87 Difference]: Start difference. First operand 1531 states and 1684 transitions. Second operand has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 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 08:25:19,370 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (bvult (bvadd (_ bv7 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse6 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv19 32)) |c_#Ultimate.C_memset_#amount|)) (.cse9 (bvult (bvadd (_ bv15 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse13 (bvult (bvadd (_ bv14 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse5 (bvult (bvadd (_ bv18 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse3 (bvult (bvadd (_ bv6 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse17 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|)) (.cse15 (bvult (bvadd (_ bv13 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse11 (bvult (bvadd (_ bv10 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse19 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv12 32)) |c_#Ultimate.C_memset_#amount|)) (.cse20 (bvult (bvadd (_ bv11 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse16 (bvult (bvadd (_ bv17 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse8 (bvult (bvadd (_ bv16 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse14 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse7 (bvult |c_#Ultimate.C_memset_#t~loopctr360| |c_#Ultimate.C_memset_#amount|)) (.cse18 (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse1 (bvult (bvadd (_ bv3 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse12 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv9 32)) |c_#Ultimate.C_memset_#amount|)) (.cse10 (bvult (bvadd (_ bv8 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))))) (and (or .cse0 (not (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv21 32)) |c_#Ultimate.C_memset_#amount|)) (bvult (bvadd (_ bv22 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (or .cse0 .cse1 (not .cse2)) (or (not .cse3) .cse0 .cse4) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))) (or (not .cse5) .cse0 .cse6) (or .cse0 .cse7) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (or .cse0 .cse8 (not .cse9)) (or .cse0 .cse10 (not .cse4)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2437) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (or (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv20 32)) |c_#Ultimate.C_memset_#amount|) (not .cse6) .cse0) (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2438))) (or .cse0 .cse11 (not .cse12)) (or (not .cse13) .cse0 .cse9) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (or (not .cse14) .cse0 .cse2) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (or (not .cse15) .cse0 .cse13) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450) |c_#memory_$Pointer$.base|)) (or .cse0 .cse5 (not .cse16)) (or .cse0 .cse3 (not .cse17)) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455))) (or .cse0 (not .cse18) .cse17) (or (not .cse19) .cse0 .cse15) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (or .cse0 .cse20 (not .cse11)) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|)) (or .cse19 .cse0 (not .cse20)) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (or .cse16 .cse0 (not .cse8)) (or .cse0 .cse14 (not .cse7)) (or .cse18 (not .cse1) .cse0) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|)) (or .cse12 (not .cse10) .cse0) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))))) is different from true [2022-12-14 08:25:20,716 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:25:21,909 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:36,251 INFO L93 Difference]: Finished difference Result 1947 states and 2182 transitions. [2022-12-14 08:26:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-12-14 08:26:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 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 88 [2022-12-14 08:26:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:36,258 INFO L225 Difference]: With dead ends: 1947 [2022-12-14 08:26:36,258 INFO L226 Difference]: Without dead ends: 1928 [2022-12-14 08:26:36,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 351 SyntacticMatches, 16 SemanticMatches, 183 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 7492 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=5735, Invalid=20866, Unknown=215, NotChecked=7224, Total=34040 [2022-12-14 08:26:36,263 INFO L413 NwaCegarLoop]: 872 mSDtfsCounter, 2892 mSDsluCounter, 23600 mSDsCounter, 0 mSdLazyCounter, 24179 mSolverCounterSat, 324 mSolverCounterUnsat, 564 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 24472 SdHoareTripleChecker+Invalid, 52733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 24179 IncrementalHoareTripleChecker+Invalid, 564 IncrementalHoareTripleChecker+Unknown, 27666 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:36,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 24472 Invalid, 52733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [324 Valid, 24179 Invalid, 564 Unknown, 27666 Unchecked, 37.8s Time] [2022-12-14 08:26:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-12-14 08:26:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1617. [2022-12-14 08:26:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1017 states have (on average 1.7295968534906587) internal successors, (1759), 1606 states have internal predecessors, (1759), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:26:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1783 transitions. [2022-12-14 08:26:36,294 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1783 transitions. Word has length 88 [2022-12-14 08:26:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:36,294 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 1783 transitions. [2022-12-14 08:26:36,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 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 08:26:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1783 transitions. [2022-12-14 08:26:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 08:26:36,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:36,296 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:36,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (25)] Ended with exit code 0 [2022-12-14 08:26:36,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-12-14 08:26:36,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 08:26:36,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:36,898 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:26:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash 363295479, now seen corresponding path program 1 times [2022-12-14 08:26:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:26:36,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32307894] [2022-12-14 08:26:36,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:36,903 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 08:26:36,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:26:36,904 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:26:36,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (28)] Waiting until timeout for monitored process [2022-12-14 08:26:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:37,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 08:26:37,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:37,709 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 08:26:37,769 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 08:26:37,769 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 08:26:37,786 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 08:26:37,853 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 08:26:39,057 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:26:39,058 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 08:26:39,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:26:39,145 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 08:26:39,161 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 08:26:39,188 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 08:26:39,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:39,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 08:26:39,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (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_2923) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 08:26:39,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2923 (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~mem33#1.base| v_ArrVal_2969))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 08:26:39,447 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:26:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32307894] [2022-12-14 08:26:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32307894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1167672348] [2022-12-14 08:26:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:39,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 08:26:39,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 08:26:39,448 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 08:26:39,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-12-14 08:26:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:42,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 08:26:42,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:42,446 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 08:26:42,512 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 08:26:42,512 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 08:26:42,524 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 08:26:42,571 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 08:26:42,746 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3339) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:42,781 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3341) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:42,865 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3345)))) is different from true [2022-12-14 08:26:42,903 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3347) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:43,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3352) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:43,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3353) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:43,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3368) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:26:43,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3370)))) is different from true [2022-12-14 08:26:43,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3371)))) is different from true [2022-12-14 08:26:43,484 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3373)))) is different from true [2022-12-14 08:26:43,557 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3376)))) is different from true [2022-12-14 08:26:43,632 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:26:43,632 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 08:26:43,682 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:26:43,682 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 08:26:43,701 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 08:26:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 429 not checked. [2022-12-14 08:26:43,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:46,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1167672348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815201419] [2022-12-14 08:26:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:46,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:46,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:46,092 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:46,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 08:26:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:46,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 08:26:46,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:46,607 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:26:46,607 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 08:26:46,641 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 08:26:48,577 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:26:48,577 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 08:26:50,718 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:26:50,719 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 08:26:50,732 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 08:26:50,736 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 08:26:50,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:50,752 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 08:26:50,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (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_3831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 08:26:50,994 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-12-14 08:26:50,994 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 08:26:51,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3877))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-12-14 08:26:51,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815201419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:51,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:26:51,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 12] total 30 [2022-12-14 08:26:51,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364948855] [2022-12-14 08:26:51,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:26:51,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 08:26:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:26:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 08:26:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=457, Unknown=48, NotChecked=1020, Total=1640 [2022-12-14 08:26:51,006 INFO L87 Difference]: Start difference. First operand 1617 states and 1783 transitions. Second operand has 31 states, 28 states have (on average 4.714285714285714) internal successors, (132), 30 states have internal predecessors, (132), 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 08:27:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:27:14,321 INFO L93 Difference]: Finished difference Result 1889 states and 2041 transitions. [2022-12-14 08:27:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 08:27:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.714285714285714) internal successors, (132), 30 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-12-14 08:27:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:27:14,324 INFO L225 Difference]: With dead ends: 1889 [2022-12-14 08:27:14,324 INFO L226 Difference]: Without dead ends: 1889 [2022-12-14 08:27:14,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 196 SyntacticMatches, 123 SemanticMatches, 49 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=208, Invalid=923, Unknown=59, NotChecked=1360, Total=2550 [2022-12-14 08:27:14,325 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 2684 mSDsluCounter, 9583 mSDsCounter, 0 mSdLazyCounter, 9563 mSolverCounterSat, 54 mSolverCounterUnsat, 1208 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 10432 SdHoareTripleChecker+Invalid, 26874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 9563 IncrementalHoareTripleChecker+Invalid, 1208 IncrementalHoareTripleChecker+Unknown, 16049 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-12-14 08:27:14,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 10432 Invalid, 26874 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 9563 Invalid, 1208 Unknown, 16049 Unchecked, 22.6s Time] [2022-12-14 08:27:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-12-14 08:27:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1616. [2022-12-14 08:27:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1017 states have (on average 1.7286135693215339) internal successors, (1758), 1605 states have internal predecessors, (1758), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:27:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1782 transitions. [2022-12-14 08:27:14,339 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1782 transitions. Word has length 113 [2022-12-14 08:27:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:27:14,339 INFO L495 AbstractCegarLoop]: Abstraction has 1616 states and 1782 transitions. [2022-12-14 08:27:14,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.714285714285714) internal successors, (132), 30 states have internal predecessors, (132), 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 08:27:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1782 transitions. [2022-12-14 08:27:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 08:27:14,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:27:14,340 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:27:14,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 (28)] Ended with exit code 0 [2022-12-14 08:27:14,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-12-14 08:27:14,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-14 08:27:14,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:14,942 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-12-14 08:27:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:27:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 363295480, now seen corresponding path program 1 times [2022-12-14 08:27:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 08:27:14,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654068452] [2022-12-14 08:27:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:14,946 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 08:27:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 08:27:14,947 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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 08:27:14,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/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)] Waiting until timeout for monitored process [2022-12-14 08:27:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:15,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 08:27:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:27:15,725 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 08:27:15,802 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 08:27:15,812 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:27:15,812 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 08:27:15,830 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 08:27:15,837 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 08:27:15,938 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 08:27:15,943 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 08:27:16,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 08:27:16,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250)))) is different from true [2022-12-14 08:27:16,092 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:16,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-12-14 08:27:16,115 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256)))) is different from true [2022-12-14 08:27:16,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:16,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263)))) is different from true [2022-12-14 08:27:16,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265)))) is different from true [2022-12-14 08:27:16,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268)))) is different from true [2022-12-14 08:27:16,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:16,217 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4273) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,253 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276)))) is different from true [2022-12-14 08:27:16,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4283))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282)))) is different from true [2022-12-14 08:27:16,325 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4285))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4284) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,335 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,356 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4291) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4292)))) is different from true [2022-12-14 08:27:16,377 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:16,391 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296)))) is different from true [2022-12-14 08:27:16,402 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299)))) is different from true [2022-12-14 08:27:16,412 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301)))) is different from true [2022-12-14 08:27:16,422 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,431 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4305))) (exists ((v_ArrVal_4304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4304)))) is different from true [2022-12-14 08:27:16,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4307))) (exists ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4306)))) is different from true [2022-12-14 08:27:16,451 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4309) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4308 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4308)))) is different from true [2022-12-14 08:27:16,460 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4311))) (exists ((v_ArrVal_4310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4310)))) is different from true [2022-12-14 08:27:16,470 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4312))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4313)))) is different from true [2022-12-14 08:27:16,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4315) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4314)))) is different from true [2022-12-14 08:27:16,491 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4316))) (exists ((v_ArrVal_4317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4317) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4318))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4319)))) is different from true [2022-12-14 08:27:16,512 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4321) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,523 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4322))) (exists ((v_ArrVal_4323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4323))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 08:27:16,533 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4325))) (exists ((v_ArrVal_4324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4324)))) is different from true [2022-12-14 08:27:16,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4327))) (exists ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4326) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:16,554 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4328)))) is different from true [2022-12-14 08:27:16,564 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4331) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:16,601 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:27:16,601 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 08:27:16,615 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 08:27:16,707 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:27:16,707 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 08:27:16,714 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 08:27:16,737 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 08:27:16,740 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 08:27:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 969 not checked. [2022-12-14 08:27:16,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:27:16,923 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |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 08:27:16,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 08:27:17,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425) .cse0 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 08:27:17,731 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 08:27:17,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654068452] [2022-12-14 08:27:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654068452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:27:17,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [640608909] [2022-12-14 08:27:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 08:27:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 08:27:17,732 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 08:27:17,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-14 08:27:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:21,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 08:27:21,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:27:21,257 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 08:27:21,263 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 08:27:21,626 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:27:21,626 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 08:27:21,637 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 08:27:21,703 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 08:27:21,715 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 08:27:21,821 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 08:27:21,877 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 08:27:21,967 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (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)))) is different from true [2022-12-14 08:27:21,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795)))) is different from true [2022-12-14 08:27:21,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:22,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32)))) is different from true [2022-12-14 08:27:22,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (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)))) is different from true [2022-12-14 08:27:22,290 WARN L859 $PredicateComparison]: unable to prove that (and (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_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32)))) is different from true [2022-12-14 08:27:22,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (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_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32)))) is different from true [2022-12-14 08:27:22,438 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4807) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:22,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811)))) is different from true [2022-12-14 08:27:22,750 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814)))) is different from true [2022-12-14 08:27:22,759 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:22,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817)))) is different from true [2022-12-14 08:27:22,894 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819)))) is different from true [2022-12-14 08:27:22,903 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820)))) is different from true [2022-12-14 08:27:22,912 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4821)))) is different from true [2022-12-14 08:27:22,922 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822)))) is different from true [2022-12-14 08:27:22,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823)))) is different from true [2022-12-14 08:27:23,062 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4826))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32)))) is different from true [2022-12-14 08:27:23,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830)))) is different from true [2022-12-14 08:27:23,256 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831)))) is different from true [2022-12-14 08:27:23,266 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832)))) is different from true [2022-12-14 08:27:23,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:23,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834)))) is different from true [2022-12-14 08:27:23,292 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:23,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836)))) is different from true [2022-12-14 08:27:23,312 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4837)))) is different from true [2022-12-14 08:27:23,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:23,340 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 08:27:23,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:23,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-12-14 08:27:23,560 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 08:27:23,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-12-14 08:27:23,673 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 15 [2022-12-14 08:27:23,676 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 26 treesize of output 14 [2022-12-14 08:27:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-12-14 08:27:23,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:27:24,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-12-14 08:27:27,289 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4839 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse1 (select |c_#length| v_arrayElimCell_60))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (bvule (bvadd (_ bv8 32) (select (select (store .cse2 v_arrayElimCell_60 (store (select .cse2 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse0) v_ArrVal_4839)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse1))))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_60 (store (select .cse5 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse6) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse4) (bvadd (_ bv8 32) .cse4)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_60))))))))) is different from false [2022-12-14 08:27:27,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [640608909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:27:27,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398050479] [2022-12-14 08:27:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:27,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:27,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:27:27,304 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:27:27,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c12862e-56d9-497a-88bf-696f8b6a987d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 08:27:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:27,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 08:27:27,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:27:27,865 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 08:27:27,875 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 08:27:27,876 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 08:27:27,889 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 08:27:27,900 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 08:27:27,957 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 08:27:27,961 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 08:27:28,005 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254)))) is different from true [2022-12-14 08:27:28,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:28,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:28,037 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 08:27:28,048 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261)))) is different from true [2022-12-14 08:27:28,059 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:28,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:28,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268)))) is different from true [2022-12-14 08:27:28,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:28,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272)))) is different from true [2022-12-14 08:27:28,116 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273))) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:28,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275))) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-12-14 08:27:28,134 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278)))) is different from true [2022-12-14 08:27:28,143 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-12-14 08:27:28,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282)))) is different from true [2022-12-14 08:27:28,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-12-14 08:27:28,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285)))) is different from true [2022-12-14 08:27:28,187 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_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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|))) is different from true [2022-12-14 08:27:28,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:28,209 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292)))) is different from true [2022-12-14 08:27:28,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-12-14 08:27:28,231 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295))) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296)))) is different from true [2022-12-14 08:27:28,242 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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)))) is different from true [2022-12-14 08:27:28,253 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299)))) is different from true [2022-12-14 08:27:28,264 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-12-14 08:27:28,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:28,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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|))) is different from true [2022-12-14 08:27:28,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-12-14 08:27:28,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310)))) is different from true [2022-12-14 08:27:28,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 08:27:28,332 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314)))) is different from true [2022-12-14 08:27:28,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 08:27:28,353 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:28,365 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-12-14 08:27:28,376 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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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 08:27:28,387 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 08:27:28,397 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_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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)))) is different from true [2022-12-14 08:27:28,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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)))) is different from true [2022-12-14 08:27:28,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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|))) is different from true [2022-12-14 08:27:28,430 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 08:27:28,440 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-12-14 08:27:28,451 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336)))) is different from true [2022-12-14 08:27:28,462 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338)))) is different from true [2022-12-14 08:27:28,473 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 08:27:28,513 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:27:28,514 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 08:27:28,523 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 08:27:28,582 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:27:28,582 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 08:27:28,587 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 08:27:28,610 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 08:27:28,613 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 08:27:28,618 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 08:27:28,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:27:28,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |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 08:27:28,702 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_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |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 08:27:29,428 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5434) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5433))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5434) .cse2 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 08:27:29,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398050479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:27:29,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:27:29,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 37, 53] total 128 [2022-12-14 08:27:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466224611] [2022-12-14 08:27:29,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:27:29,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2022-12-14 08:27:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 08:27:29,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2022-12-14 08:27:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=609, Unknown=150, NotChecked=18400, Total=19460 [2022-12-14 08:27:29,438 INFO L87 Difference]: Start difference. First operand 1616 states and 1782 transitions. Second operand has 129 states, 126 states have (on average 2.246031746031746) internal successors, (283), 129 states have internal predecessors, (283), 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 08:27:30,788 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (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_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_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-12-14 08:27:30,795 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4283))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (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_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4826))) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811))) (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_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830))) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268)))) is different from true [2022-12-14 08:27:31,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4283))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (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_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4285))) (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4826))) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4284) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811))) (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_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_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4807) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830))) (exists ((v_ArrVal_4821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4821))) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-12-14 08:27:31,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (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_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-12-14 08:28:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:28:01,302 INFO L93 Difference]: Finished difference Result 2440 states and 2636 transitions. [2022-12-14 08:28:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 08:28:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 126 states have (on average 2.246031746031746) internal successors, (283), 129 states have internal predecessors, (283), 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 113 [2022-12-14 08:28:01,303 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-12-14 08:28:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 126 states have (on average 2.246031746031746) internal successors, (283), 129 states have internal predecessors, (283), 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 113