./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:12:29,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:12:29,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:12:29,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:12:29,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:12:29,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:12:29,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:12:29,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:12:29,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:12:29,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:12:29,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:12:29,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:12:29,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:12:29,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:12:29,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:12:29,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:12:29,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:12:29,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:12:29,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:12:29,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:12:29,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:12:29,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:12:29,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:12:29,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:12:29,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:12:29,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:12:29,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:12:29,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:12:29,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:12:29,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:12:29,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:12:29,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:12:29,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:12:29,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:12:29,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:12:29,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:12:29,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:12:29,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:12:29,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:12:29,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:12:29,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:12:29,587 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 07:12:29,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:12:29,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:12:29,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:12:29,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:12:29,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:12:29,610 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:12:29,610 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:12:29,610 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:12:29,610 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:12:29,611 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:12:29,611 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:12:29,611 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:12:29,611 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:12:29,611 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:12:29,611 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:12:29,612 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:12:29,612 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:12:29,612 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:12:29,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:12:29,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:12:29,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:12:29,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:12:29,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:12:29,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:12:29,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:12:29,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:12:29,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:12:29,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:12:29,614 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:12:29,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:12:29,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:12:29,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:12:29,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:12:29,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:12:29,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:12:29,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:12:29,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:12:29,616 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:12:29,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:12:29,617 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:12:29,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:12:29,617 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:12:29,617 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2022-12-14 07:12:29,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:12:29,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:12:29,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:12:29,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:12:29,845 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:12:29,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-12-14 07:12:32,366 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:12:32,602 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:12:32,602 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-12-14 07:12:32,613 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data/96764bac4/af3d5857e75b4d0ea55ad1431dc74291/FLAG467d3bf44 [2022-12-14 07:12:32,941 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data/96764bac4/af3d5857e75b4d0ea55ad1431dc74291 [2022-12-14 07:12:32,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:12:32,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:12:32,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:12:32,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:12:32,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:12:32,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:12:32" (1/1) ... [2022-12-14 07:12:32,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396cc0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:32, skipping insertion in model container [2022-12-14 07:12:32,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:12:32" (1/1) ... [2022-12-14 07:12:32,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:12:33,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:12:33,345 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-12-14 07:12:33,422 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:33,432 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:33,442 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:33,451 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:33,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:12:33,472 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-12-14 07:12:33,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65a393a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:33, skipping insertion in model container [2022-12-14 07:12:33,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:12:33,472 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 07:12:33,474 INFO L158 Benchmark]: Toolchain (without parser) took 528.94ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 55.1MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 07:12:33,474 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:12:33,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.26ms. Allocated memory is still 123.7MB. Free memory was 83.5MB in the beginning and 55.1MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 07:12:33,475 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.26ms. Allocated memory is still 123.7MB. Free memory was 83.5MB in the beginning and 55.1MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:12:34,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:12:34,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:12:34,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:12:34,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:12:34,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:12:34,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:12:34,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:12:34,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:12:34,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:12:34,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:12:34,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:12:34,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:12:34,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:12:34,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:12:34,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:12:34,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:12:34,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:12:34,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:12:34,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:12:34,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:12:34,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:12:34,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:12:34,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:12:34,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:12:34,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:12:34,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:12:34,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:12:34,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:12:34,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:12:34,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:12:34,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:12:34,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:12:34,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:12:34,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:12:34,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:12:34,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:12:34,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:12:34,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:12:34,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:12:34,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:12:34,890 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 07:12:34,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:12:34,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:12:34,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:12:34,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:12:34,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:12:34,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:12:34,916 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:12:34,916 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:12:34,916 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:12:34,916 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:12:34,916 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:12:34,917 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:12:34,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:12:34,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:12:34,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:12:34,918 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:12:34,918 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:12:34,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:12:34,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:12:34,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:12:34,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:12:34,919 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:12:34,919 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:12:34,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:12:34,919 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:12:34,920 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 07:12:34,920 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 07:12:34,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:12:34,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:12:34,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:12:34,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 07:12:34,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:12:34,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:12:34,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:12:34,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:12:34,926 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 07:12:34,926 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 07:12:34,926 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:12:34,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 07:12:34,927 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2022-12-14 07:12:35,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:12:35,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:12:35,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:12:35,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:12:35,217 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:12:35,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-12-14 07:12:37,760 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:12:38,033 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:12:38,033 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-12-14 07:12:38,049 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data/5ec40e1bc/6b873d7676c24d0c9eb9c334a1bc591b/FLAGd439522ae [2022-12-14 07:12:38,061 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/data/5ec40e1bc/6b873d7676c24d0c9eb9c334a1bc591b [2022-12-14 07:12:38,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:12:38,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:12:38,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:12:38,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:12:38,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:12:38,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561ae89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38, skipping insertion in model container [2022-12-14 07:12:38,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:12:38,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:12:38,420 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-12-14 07:12:38,529 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,545 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,561 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,574 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:12:38,604 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 07:12:38,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:12:38,636 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-12-14 07:12:38,683 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,690 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,696 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,703 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:12:38,713 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:12:38,730 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_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-12-14 07:12:38,764 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,769 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,774 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,779 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 07:12:38,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:12:38,805 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:12:38,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38 WrapperNode [2022-12-14 07:12:38,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:12:38,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:12:38,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:12:38,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:12:38,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,898 INFO L138 Inliner]: procedures = 180, calls = 575, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2340 [2022-12-14 07:12:38,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:12:38,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:12:38,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:12:38,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:12:38,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,981 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:38,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:12:38,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:12:38,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:12:38,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:12:38,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (1/1) ... [2022-12-14 07:12:39,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:12:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:12:39,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:12:39,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:12:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 07:12:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-12-14 07:12:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-12-14 07:12:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 07:12:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 07:12:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 07:12:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 07:12:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 07:12:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:12:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 07:12:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 07:12:39,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:12:39,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:12:39,284 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:12:39,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:12:39,291 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 07:12:46,338 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:12:46,350 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:12:46,350 INFO L300 CfgBuilder]: Removed 160 assume(true) statements. [2022-12-14 07:12:46,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:12:46 BoogieIcfgContainer [2022-12-14 07:12:46,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:12:46,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:12:46,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:12:46,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:12:46,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:12:38" (1/3) ... [2022-12-14 07:12:46,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14baec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:12:46, skipping insertion in model container [2022-12-14 07:12:46,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:38" (2/3) ... [2022-12-14 07:12:46,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14baec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:12:46, skipping insertion in model container [2022-12-14 07:12:46,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:12:46" (3/3) ... [2022-12-14 07:12:46,359 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-2.i [2022-12-14 07:12:46,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:12:46,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1095 error locations. [2022-12-14 07:12:46,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:12:46,432 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;@fb37c08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:12:46,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1095 error locations. [2022-12-14 07:12:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 2257 states, 1150 states have (on average 2.214782608695652) internal successors, (2547), 2243 states have internal predecessors, (2547), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-14 07:12:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:12:46,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:46,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:12:46,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:12:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-12-14 07:12:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:46,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197801246] [2022-12-14 07:12:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:46,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:12:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:46,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:12:46,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 07:12:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:46,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:12:46,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:46,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:12:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:46,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:46,658 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:46,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197801246] [2022-12-14 07:12:46,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197801246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:46,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:46,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:12:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643538276] [2022-12-14 07:12:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:12:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:12:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:46,688 INFO L87 Difference]: Start difference. First operand has 2257 states, 1150 states have (on average 2.214782608695652) internal successors, (2547), 2243 states have internal predecessors, (2547), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:50,052 INFO L93 Difference]: Finished difference Result 2931 states and 3114 transitions. [2022-12-14 07:12:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:12:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:12:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:50,071 INFO L225 Difference]: With dead ends: 2931 [2022-12-14 07:12:50,071 INFO L226 Difference]: Without dead ends: 2929 [2022-12-14 07:12:50,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:50,074 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2138 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:50,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2148 Valid, 1863 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 07:12:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2022-12-14 07:12:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2399. [2022-12-14 07:12:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 1316 states have (on average 2.0516717325227964) internal successors, (2700), 2383 states have internal predecessors, (2700), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 07:12:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 2732 transitions. [2022-12-14 07:12:50,155 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 2732 transitions. Word has length 3 [2022-12-14 07:12:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:50,155 INFO L495 AbstractCegarLoop]: Abstraction has 2399 states and 2732 transitions. [2022-12-14 07:12:50,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 2732 transitions. [2022-12-14 07:12:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:12:50,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:50,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:12:50,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:12:50,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:12:50,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:12:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-12-14 07:12:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:50,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411496820] [2022-12-14 07:12:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:50,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:12:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:50,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:12:50,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 07:12:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:50,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:12:50,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:50,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:12:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:50,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:50,562 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411496820] [2022-12-14 07:12:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411496820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:50,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:50,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:12:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952923872] [2022-12-14 07:12:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:50,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:12:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:12:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:50,564 INFO L87 Difference]: Start difference. First operand 2399 states and 2732 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:12:55,500 INFO L93 Difference]: Finished difference Result 3369 states and 3794 transitions. [2022-12-14 07:12:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:12:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:12:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:12:55,506 INFO L225 Difference]: With dead ends: 3369 [2022-12-14 07:12:55,506 INFO L226 Difference]: Without dead ends: 3369 [2022-12-14 07:12:55,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:12:55,507 INFO L413 NwaCegarLoop]: 1947 mSDtfsCounter, 1054 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:12:55,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3237 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 07:12:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2022-12-14 07:12:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 2848. [2022-12-14 07:12:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 1763 states have (on average 2.0096426545660804) internal successors, (3543), 2829 states have internal predecessors, (3543), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 07:12:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3581 transitions. [2022-12-14 07:12:55,571 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3581 transitions. Word has length 3 [2022-12-14 07:12:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:12:55,571 INFO L495 AbstractCegarLoop]: Abstraction has 2848 states and 3581 transitions. [2022-12-14 07:12:55,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:12:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3581 transitions. [2022-12-14 07:12:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:12:55,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:12:55,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:12:55,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 07:12:55,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:12:55,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:12:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:12:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-12-14 07:12:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:12:55,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24467975] [2022-12-14 07:12:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:12:55,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:12:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:12:55,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:12:55,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 07:12:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:12:55,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:12:55,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:12:55,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:12:55,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:12:55,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:12:55,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 07:12:55,985 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:12:55,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:12:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:12:56,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:12:56,004 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:12:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24467975] [2022-12-14 07:12:56,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24467975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:12:56,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:12:56,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:12:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359302512] [2022-12-14 07:12:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:12:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:12:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:12:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:12:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:12:56,005 INFO L87 Difference]: Start difference. First operand 2848 states and 3581 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:05,453 INFO L93 Difference]: Finished difference Result 5477 states and 6380 transitions. [2022-12-14 07:13:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:05,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 07:13:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:05,466 INFO L225 Difference]: With dead ends: 5477 [2022-12-14 07:13:05,466 INFO L226 Difference]: Without dead ends: 5477 [2022-12-14 07:13:05,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:05,467 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 4878 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4888 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:05,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4888 Valid, 2299 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-12-14 07:13:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2022-12-14 07:13:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 3565. [2022-12-14 07:13:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 2480 states have (on average 2.042741935483871) internal successors, (5066), 3540 states have internal predecessors, (5066), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 5116 transitions. [2022-12-14 07:13:05,549 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 5116 transitions. Word has length 7 [2022-12-14 07:13:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:05,549 INFO L495 AbstractCegarLoop]: Abstraction has 3565 states and 5116 transitions. [2022-12-14 07:13:05,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 5116 transitions. [2022-12-14 07:13:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:13:05,550 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:05,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:05,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 07:13:05,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:05,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-12-14 07:13:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:05,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988416616] [2022-12-14 07:13:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:05,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:05,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 07:13:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:05,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:05,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:05,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:13:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:05,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:05,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:05,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988416616] [2022-12-14 07:13:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988416616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:05,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:13:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048692543] [2022-12-14 07:13:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:13:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:13:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:05,886 INFO L87 Difference]: Start difference. First operand 3565 states and 5116 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:09,473 INFO L93 Difference]: Finished difference Result 4769 states and 6633 transitions. [2022-12-14 07:13:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:13:09,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 07:13:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:09,482 INFO L225 Difference]: With dead ends: 4769 [2022-12-14 07:13:09,482 INFO L226 Difference]: Without dead ends: 4769 [2022-12-14 07:13:09,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:09,483 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 1994 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:09,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 2929 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 07:13:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-12-14 07:13:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3474. [2022-12-14 07:13:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 2480 states have (on average 1.9568548387096774) internal successors, (4853), 3449 states have internal predecessors, (4853), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4903 transitions. [2022-12-14 07:13:09,527 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4903 transitions. Word has length 8 [2022-12-14 07:13:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:09,527 INFO L495 AbstractCegarLoop]: Abstraction has 3474 states and 4903 transitions. [2022-12-14 07:13:09,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4903 transitions. [2022-12-14 07:13:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:13:09,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:09,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:09,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 07:13:09,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:09,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-12-14 07:13:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:09,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392142895] [2022-12-14 07:13:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:09,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:09,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:09,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 07:13:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:09,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:13:09,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:09,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:13:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:09,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:09,890 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:09,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392142895] [2022-12-14 07:13:09,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392142895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:09,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:09,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:13:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107902526] [2022-12-14 07:13:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:09,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:13:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:13:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:09,891 INFO L87 Difference]: Start difference. First operand 3474 states and 4903 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:15,083 INFO L93 Difference]: Finished difference Result 5189 states and 7261 transitions. [2022-12-14 07:13:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:13:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 07:13:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:15,097 INFO L225 Difference]: With dead ends: 5189 [2022-12-14 07:13:15,097 INFO L226 Difference]: Without dead ends: 5189 [2022-12-14 07:13:15,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:15,098 INFO L413 NwaCegarLoop]: 2553 mSDtfsCounter, 1369 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3640 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:15,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3640 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 07:13:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2022-12-14 07:13:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 3796. [2022-12-14 07:13:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 2812 states have (on average 1.943456614509246) internal successors, (5465), 3771 states have internal predecessors, (5465), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 5515 transitions. [2022-12-14 07:13:15,165 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 5515 transitions. Word has length 8 [2022-12-14 07:13:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:15,166 INFO L495 AbstractCegarLoop]: Abstraction has 3796 states and 5515 transitions. [2022-12-14 07:13:15,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 5515 transitions. [2022-12-14 07:13:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:13:15,166 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:15,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:15,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Forceful destruction successful, exit code 0 [2022-12-14 07:13:15,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:15,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-12-14 07:13:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608800637] [2022-12-14 07:13:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:15,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:15,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:15,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:15,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 07:13:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:15,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:13:15,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:15,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:15,484 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608800637] [2022-12-14 07:13:15,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608800637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:15,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:15,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788415544] [2022-12-14 07:13:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:15,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:13:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:13:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:15,485 INFO L87 Difference]: Start difference. First operand 3796 states and 5515 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 07:13:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:15,519 INFO L93 Difference]: Finished difference Result 3736 states and 5429 transitions. [2022-12-14 07:13:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:13:15,520 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 07:13:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:15,527 INFO L225 Difference]: With dead ends: 3736 [2022-12-14 07:13:15,527 INFO L226 Difference]: Without dead ends: 3736 [2022-12-14 07:13:15,527 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 07:13:15,528 INFO L413 NwaCegarLoop]: 2217 mSDtfsCounter, 1011 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:15,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3429 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-12-14 07:13:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3736. [2022-12-14 07:13:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 2776 states have (on average 1.9376801152737753) internal successors, (5379), 3711 states have internal predecessors, (5379), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 5429 transitions. [2022-12-14 07:13:15,567 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 5429 transitions. Word has length 11 [2022-12-14 07:13:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:15,567 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 5429 transitions. [2022-12-14 07:13:15,567 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 07:13:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 5429 transitions. [2022-12-14 07:13:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:13:15,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:15,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:15,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 07:13:15,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:15,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-12-14 07:13:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:15,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641351262] [2022-12-14 07:13:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:15,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:15,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:15,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 07:13:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:15,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:15,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:15,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:15,966 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:15,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641351262] [2022-12-14 07:13:15,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641351262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:15,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:15,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804796233] [2022-12-14 07:13:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:15,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:15,968 INFO L87 Difference]: Start difference. First operand 3736 states and 5429 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 07:13:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:16,043 INFO L93 Difference]: Finished difference Result 3708 states and 5373 transitions. [2022-12-14 07:13:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:16,044 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 07:13:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:16,053 INFO L225 Difference]: With dead ends: 3708 [2022-12-14 07:13:16,054 INFO L226 Difference]: Without dead ends: 3708 [2022-12-14 07:13:16,054 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 07:13:16,054 INFO L413 NwaCegarLoop]: 2172 mSDtfsCounter, 992 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 5549 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:16,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 5549 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-12-14 07:13:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3706. [2022-12-14 07:13:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 2760 states have (on average 1.9278985507246378) internal successors, (5321), 3681 states have internal predecessors, (5321), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5371 transitions. [2022-12-14 07:13:16,092 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5371 transitions. Word has length 13 [2022-12-14 07:13:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:16,092 INFO L495 AbstractCegarLoop]: Abstraction has 3706 states and 5371 transitions. [2022-12-14 07:13:16,092 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 07:13:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5371 transitions. [2022-12-14 07:13:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:13:16,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:16,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:16,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Ended with exit code 0 [2022-12-14 07:13:16,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:16,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-12-14 07:13:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841371504] [2022-12-14 07:13:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:16,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:16,300 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:16,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 07:13:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:16,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:13:16,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:16,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:16,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:16,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841371504] [2022-12-14 07:13:16,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841371504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:16,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:16,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557204186] [2022-12-14 07:13:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:16,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:13:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:13:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:16,590 INFO L87 Difference]: Start difference. First operand 3706 states and 5371 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:16,646 INFO L93 Difference]: Finished difference Result 5153 states and 6936 transitions. [2022-12-14 07:13:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:13:16,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 07:13:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:16,653 INFO L225 Difference]: With dead ends: 5153 [2022-12-14 07:13:16,654 INFO L226 Difference]: Without dead ends: 5153 [2022-12-14 07:13:16,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:16,654 INFO L413 NwaCegarLoop]: 3713 mSDtfsCounter, 2098 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 5327 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:16,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 5327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2022-12-14 07:13:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 3646. [2022-12-14 07:13:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3646 states, 2724 states have (on average 1.921806167400881) internal successors, (5235), 3621 states have internal predecessors, (5235), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5285 transitions. [2022-12-14 07:13:16,694 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 5285 transitions. Word has length 20 [2022-12-14 07:13:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:16,695 INFO L495 AbstractCegarLoop]: Abstraction has 3646 states and 5285 transitions. [2022-12-14 07:13:16,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 5285 transitions. [2022-12-14 07:13:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:13:16,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:16,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:16,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 07:13:16,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:16,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:16,898 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-12-14 07:13:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:16,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278843953] [2022-12-14 07:13:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:16,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:16,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 07:13:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:17,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:13:17,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:17,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:17,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278843953] [2022-12-14 07:13:17,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278843953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:17,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:17,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134620498] [2022-12-14 07:13:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:17,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:13:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:13:17,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:17,151 INFO L87 Difference]: Start difference. First operand 3646 states and 5285 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:17,206 INFO L93 Difference]: Finished difference Result 4986 states and 6645 transitions. [2022-12-14 07:13:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:13:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 07:13:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:17,217 INFO L225 Difference]: With dead ends: 4986 [2022-12-14 07:13:17,217 INFO L226 Difference]: Without dead ends: 4986 [2022-12-14 07:13:17,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:17,218 INFO L413 NwaCegarLoop]: 3622 mSDtfsCounter, 2055 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 5188 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:17,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 5188 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2022-12-14 07:13:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 3514. [2022-12-14 07:13:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3514 states, 2616 states have (on average 1.9025229357798166) internal successors, (4977), 3489 states have internal predecessors, (4977), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5027 transitions. [2022-12-14 07:13:17,268 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5027 transitions. Word has length 20 [2022-12-14 07:13:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:17,268 INFO L495 AbstractCegarLoop]: Abstraction has 3514 states and 5027 transitions. [2022-12-14 07:13:17,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5027 transitions. [2022-12-14 07:13:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 07:13:17,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:17,269 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] [2022-12-14 07:13:17,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 07:13:17,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:17,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-12-14 07:13:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:17,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574692893] [2022-12-14 07:13:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:17,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 07:13:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:17,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:17,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 07:13:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:17,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:17,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:17,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:17,661 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:17,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574692893] [2022-12-14 07:13:17,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574692893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:17,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:17,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005890029] [2022-12-14 07:13:17,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:17,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:17,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:17,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:17,662 INFO L87 Difference]: Start difference. First operand 3514 states and 5027 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:17,748 INFO L93 Difference]: Finished difference Result 4951 states and 6579 transitions. [2022-12-14 07:13:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 07:13:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:17,753 INFO L225 Difference]: With dead ends: 4951 [2022-12-14 07:13:17,754 INFO L226 Difference]: Without dead ends: 4951 [2022-12-14 07:13:17,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:17,754 INFO L413 NwaCegarLoop]: 3582 mSDtfsCounter, 2036 mSDsluCounter, 5146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 8728 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:17,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 8728 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2022-12-14 07:13:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 3484. [2022-12-14 07:13:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 2600 states have (on average 1.8919230769230768) internal successors, (4919), 3459 states have internal predecessors, (4919), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4969 transitions. [2022-12-14 07:13:17,786 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4969 transitions. Word has length 22 [2022-12-14 07:13:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:17,786 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 4969 transitions. [2022-12-14 07:13:17,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4969 transitions. [2022-12-14 07:13:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 07:13:17,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:17,787 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] [2022-12-14 07:13:17,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 07:13:17,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:17,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-12-14 07:13:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:17,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724986086] [2022-12-14 07:13:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:17,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:17,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:17,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 07:13:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:18,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:18,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:18,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:18,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:18,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724986086] [2022-12-14 07:13:18,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724986086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:18,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:18,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662625119] [2022-12-14 07:13:18,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:18,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:18,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:18,189 INFO L87 Difference]: Start difference. First operand 3484 states and 4969 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:18,287 INFO L93 Difference]: Finished difference Result 4878 states and 6390 transitions. [2022-12-14 07:13:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:18,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 07:13:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:18,295 INFO L225 Difference]: With dead ends: 4878 [2022-12-14 07:13:18,295 INFO L226 Difference]: Without dead ends: 4878 [2022-12-14 07:13:18,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:18,296 INFO L413 NwaCegarLoop]: 3507 mSDtfsCounter, 2001 mSDsluCounter, 5031 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 8538 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:18,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 8538 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-12-14 07:13:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3422. [2022-12-14 07:13:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2552 states have (on average 1.8593260188087775) internal successors, (4745), 3397 states have internal predecessors, (4745), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4795 transitions. [2022-12-14 07:13:18,339 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4795 transitions. Word has length 22 [2022-12-14 07:13:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:18,339 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4795 transitions. [2022-12-14 07:13:18,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4795 transitions. [2022-12-14 07:13:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 07:13:18,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:18,340 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 07:13:18,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 07:13:18,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:18,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-12-14 07:13:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:18,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498029452] [2022-12-14 07:13:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:18,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:18,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:18,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 07:13:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:18,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:13:18,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:18,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:13:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:18,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:18,706 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:18,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498029452] [2022-12-14 07:13:18,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498029452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:18,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:18,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851025941] [2022-12-14 07:13:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:18,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:18,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:18,707 INFO L87 Difference]: Start difference. First operand 3422 states and 4795 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:22,346 INFO L93 Difference]: Finished difference Result 3873 states and 5152 transitions. [2022-12-14 07:13:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:22,347 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 07:13:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:22,351 INFO L225 Difference]: With dead ends: 3873 [2022-12-14 07:13:22,351 INFO L226 Difference]: Without dead ends: 3873 [2022-12-14 07:13:22,352 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 07:13:22,352 INFO L413 NwaCegarLoop]: 1240 mSDtfsCounter, 2741 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2747 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:22,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2747 Valid, 2332 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 07:13:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2022-12-14 07:13:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3418. [2022-12-14 07:13:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 2552 states have (on average 1.8561912225705328) internal successors, (4737), 3393 states have internal predecessors, (4737), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 4787 transitions. [2022-12-14 07:13:22,394 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 4787 transitions. Word has length 27 [2022-12-14 07:13:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:22,394 INFO L495 AbstractCegarLoop]: Abstraction has 3418 states and 4787 transitions. [2022-12-14 07:13:22,394 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 07:13:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 4787 transitions. [2022-12-14 07:13:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 07:13:22,395 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:22,395 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 07:13:22,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Ended with exit code 0 [2022-12-14 07:13:22,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:22,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-12-14 07:13:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:22,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665940709] [2022-12-14 07:13:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:22,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:22,597 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:22,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 07:13:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:22,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:13:22,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:22,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:13:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:22,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:22,817 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:22,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665940709] [2022-12-14 07:13:22,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665940709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:22,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:22,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:22,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967318480] [2022-12-14 07:13:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:22,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:22,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:22,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:22,818 INFO L87 Difference]: Start difference. First operand 3418 states and 4787 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 07:13:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:28,305 INFO L93 Difference]: Finished difference Result 4319 states and 5771 transitions. [2022-12-14 07:13:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:13:28,306 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 07:13:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:28,310 INFO L225 Difference]: With dead ends: 4319 [2022-12-14 07:13:28,310 INFO L226 Difference]: Without dead ends: 4319 [2022-12-14 07:13:28,310 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 07:13:28,310 INFO L413 NwaCegarLoop]: 1650 mSDtfsCounter, 1908 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:28,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 3805 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-12-14 07:13:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2022-12-14 07:13:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3454. [2022-12-14 07:13:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2588 states have (on average 1.8462132921174652) internal successors, (4778), 3429 states have internal predecessors, (4778), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4828 transitions. [2022-12-14 07:13:28,340 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4828 transitions. Word has length 27 [2022-12-14 07:13:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:28,340 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4828 transitions. [2022-12-14 07:13:28,340 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 07:13:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4828 transitions. [2022-12-14 07:13:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 07:13:28,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:28,341 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] [2022-12-14 07:13:28,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Forceful destruction successful, exit code 0 [2022-12-14 07:13:28,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:28,541 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:28,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-12-14 07:13:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:28,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468598689] [2022-12-14 07:13:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:28,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:28,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:28,543 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:28,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 07:13:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:13:28,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:28,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:13:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:28,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:28,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468598689] [2022-12-14 07:13:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468598689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:28,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606307405] [2022-12-14 07:13:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:28,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:28,752 INFO L87 Difference]: Start difference. First operand 3454 states and 4828 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:33,882 INFO L93 Difference]: Finished difference Result 6680 states and 9181 transitions. [2022-12-14 07:13:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:13:33,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 07:13:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:33,888 INFO L225 Difference]: With dead ends: 6680 [2022-12-14 07:13:33,888 INFO L226 Difference]: Without dead ends: 6680 [2022-12-14 07:13:33,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:33,889 INFO L413 NwaCegarLoop]: 2569 mSDtfsCounter, 3895 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3902 SdHoareTripleChecker+Valid, 4704 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:33,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3902 Valid, 4704 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-12-14 07:13:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2022-12-14 07:13:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 3450. [2022-12-14 07:13:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2588 states have (on average 1.8431221020092736) internal successors, (4770), 3425 states have internal predecessors, (4770), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4820 transitions. [2022-12-14 07:13:33,922 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4820 transitions. Word has length 36 [2022-12-14 07:13:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:33,923 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 4820 transitions. [2022-12-14 07:13:33,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4820 transitions. [2022-12-14 07:13:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 07:13:33,923 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:33,923 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] [2022-12-14 07:13:33,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-14 07:13:34,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:34,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:34,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-12-14 07:13:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:34,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117543368] [2022-12-14 07:13:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:34,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:34,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:34,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:34,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-14 07:13:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:34,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:13:34,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:34,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:13:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:34,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:34,434 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:34,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117543368] [2022-12-14 07:13:34,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117543368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:34,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:34,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160443201] [2022-12-14 07:13:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:34,435 INFO L87 Difference]: Start difference. First operand 3450 states and 4820 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:42,110 INFO L93 Difference]: Finished difference Result 6365 states and 8577 transitions. [2022-12-14 07:13:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:13:42,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 07:13:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:42,116 INFO L225 Difference]: With dead ends: 6365 [2022-12-14 07:13:42,117 INFO L226 Difference]: Without dead ends: 6365 [2022-12-14 07:13:42,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:42,117 INFO L413 NwaCegarLoop]: 2782 mSDtfsCounter, 2855 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2859 SdHoareTripleChecker+Valid, 5388 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:42,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2859 Valid, 5388 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-12-14 07:13:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-12-14 07:13:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 3446. [2022-12-14 07:13:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 2588 states have (on average 1.8400309119010818) internal successors, (4762), 3421 states have internal predecessors, (4762), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4812 transitions. [2022-12-14 07:13:42,153 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4812 transitions. Word has length 36 [2022-12-14 07:13:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:42,153 INFO L495 AbstractCegarLoop]: Abstraction has 3446 states and 4812 transitions. [2022-12-14 07:13:42,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4812 transitions. [2022-12-14 07:13:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 07:13:42,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:42,153 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] [2022-12-14 07:13:42,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-12-14 07:13:42,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:42,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-12-14 07:13:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:42,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333397840] [2022-12-14 07:13:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:42,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:42,357 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:42,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-14 07:13:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:42,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:13:42,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:42,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:13:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:42,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:42,606 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:42,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333397840] [2022-12-14 07:13:42,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333397840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:42,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:42,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411331258] [2022-12-14 07:13:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:42,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:42,607 INFO L87 Difference]: Start difference. First operand 3446 states and 4812 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:48,169 INFO L93 Difference]: Finished difference Result 7123 states and 9691 transitions. [2022-12-14 07:13:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:13:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 07:13:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:48,176 INFO L225 Difference]: With dead ends: 7123 [2022-12-14 07:13:48,177 INFO L226 Difference]: Without dead ends: 7123 [2022-12-14 07:13:48,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:48,177 INFO L413 NwaCegarLoop]: 2265 mSDtfsCounter, 4675 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:48,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 4587 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 07:13:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7123 states. [2022-12-14 07:13:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7123 to 3443. [2022-12-14 07:13:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2588 states have (on average 1.8315301391035548) internal successors, (4740), 3418 states have internal predecessors, (4740), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4790 transitions. [2022-12-14 07:13:48,213 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4790 transitions. Word has length 36 [2022-12-14 07:13:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:48,213 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4790 transitions. [2022-12-14 07:13:48,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4790 transitions. [2022-12-14 07:13:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 07:13:48,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:48,213 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] [2022-12-14 07:13:48,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-14 07:13:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:48,414 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-12-14 07:13:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:48,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236525654] [2022-12-14 07:13:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:48,416 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:48,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-14 07:13:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:48,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:13:48,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:48,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:13:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:48,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:48,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236525654] [2022-12-14 07:13:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236525654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:48,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:48,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166797017] [2022-12-14 07:13:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:48,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:48,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:48,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:48,727 INFO L87 Difference]: Start difference. First operand 3443 states and 4790 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:55,339 INFO L93 Difference]: Finished difference Result 5201 states and 6963 transitions. [2022-12-14 07:13:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:13:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 07:13:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:55,343 INFO L225 Difference]: With dead ends: 5201 [2022-12-14 07:13:55,343 INFO L226 Difference]: Without dead ends: 5201 [2022-12-14 07:13:55,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:55,344 INFO L413 NwaCegarLoop]: 2555 mSDtfsCounter, 2416 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:55,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 4734 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-12-14 07:13:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-12-14 07:13:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 3443. [2022-12-14 07:13:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 2588 states have (on average 1.8284389489953632) internal successors, (4732), 3418 states have internal predecessors, (4732), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4782 transitions. [2022-12-14 07:13:55,371 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4782 transitions. Word has length 36 [2022-12-14 07:13:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:55,371 INFO L495 AbstractCegarLoop]: Abstraction has 3443 states and 4782 transitions. [2022-12-14 07:13:55,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4782 transitions. [2022-12-14 07:13:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 07:13:55,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:55,372 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] [2022-12-14 07:13:55,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-12-14 07:13:55,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:55,572 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-12-14 07:13:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:55,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128764005] [2022-12-14 07:13:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:55,574 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:55,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:13:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:55,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:55,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:55,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:55,746 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:55,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128764005] [2022-12-14 07:13:55,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128764005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:55,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:55,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072797370] [2022-12-14 07:13:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:55,747 INFO L87 Difference]: Start difference. First operand 3443 states and 4782 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:55,798 INFO L93 Difference]: Finished difference Result 3431 states and 4758 transitions. [2022-12-14 07:13:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:55,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-12-14 07:13:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:55,801 INFO L225 Difference]: With dead ends: 3431 [2022-12-14 07:13:55,801 INFO L226 Difference]: Without dead ends: 3431 [2022-12-14 07:13:55,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:55,802 INFO L413 NwaCegarLoop]: 2003 mSDtfsCounter, 969 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 5030 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:55,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 5030 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2022-12-14 07:13:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2022-12-14 07:13:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 2576 states have (on average 1.8276397515527951) internal successors, (4708), 3406 states have internal predecessors, (4708), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:13:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 4758 transitions. [2022-12-14 07:13:55,826 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 4758 transitions. Word has length 40 [2022-12-14 07:13:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:55,827 INFO L495 AbstractCegarLoop]: Abstraction has 3431 states and 4758 transitions. [2022-12-14 07:13:55,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 4758 transitions. [2022-12-14 07:13:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 07:13:55,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:55,827 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] [2022-12-14 07:13:55,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:13:56,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:56,028 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-12-14 07:13:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:56,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845229192] [2022-12-14 07:13:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:56,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:56,030 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:56,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-14 07:13:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:56,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:56,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:56,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:56,369 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845229192] [2022-12-14 07:13:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845229192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:56,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:56,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:13:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737840470] [2022-12-14 07:13:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:56,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:13:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:13:56,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:56,371 INFO L87 Difference]: Start difference. First operand 3431 states and 4758 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:56,649 INFO L93 Difference]: Finished difference Result 5072 states and 6779 transitions. [2022-12-14 07:13:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:13:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-12-14 07:13:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:56,654 INFO L225 Difference]: With dead ends: 5072 [2022-12-14 07:13:56,654 INFO L226 Difference]: Without dead ends: 5072 [2022-12-14 07:13:56,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:13:56,655 INFO L413 NwaCegarLoop]: 2092 mSDtfsCounter, 1380 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:56,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 3942 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:13:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-12-14 07:13:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4447. [2022-12-14 07:13:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4447 states, 3585 states have (on average 1.814504881450488) internal successors, (6505), 4412 states have internal predecessors, (6505), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 07:13:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6575 transitions. [2022-12-14 07:13:56,703 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6575 transitions. Word has length 48 [2022-12-14 07:13:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:56,703 INFO L495 AbstractCegarLoop]: Abstraction has 4447 states and 6575 transitions. [2022-12-14 07:13:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6575 transitions. [2022-12-14 07:13:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 07:13:56,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:56,704 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] [2022-12-14 07:13:56,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-12-14 07:13:56,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:56,905 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-12-14 07:13:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196422761] [2022-12-14 07:13:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:56,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:56,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:56,911 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:56,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-14 07:13:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:57,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:57,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:57,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:57,133 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196422761] [2022-12-14 07:13:57,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196422761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:57,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:57,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717679143] [2022-12-14 07:13:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:57,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:57,135 INFO L87 Difference]: Start difference. First operand 4447 states and 6575 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:57,190 INFO L93 Difference]: Finished difference Result 5580 states and 7761 transitions. [2022-12-14 07:13:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-14 07:13:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:57,195 INFO L225 Difference]: With dead ends: 5580 [2022-12-14 07:13:57,195 INFO L226 Difference]: Without dead ends: 5580 [2022-12-14 07:13:57,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:57,195 INFO L413 NwaCegarLoop]: 3056 mSDtfsCounter, 1964 mSDsluCounter, 4351 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 7407 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:57,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 7407 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5580 states. [2022-12-14 07:13:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5580 to 4405. [2022-12-14 07:13:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4405 states, 3543 states have (on average 1.8162574089754446) internal successors, (6435), 4370 states have internal predecessors, (6435), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 07:13:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 6505 transitions. [2022-12-14 07:13:57,229 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 6505 transitions. Word has length 51 [2022-12-14 07:13:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:57,229 INFO L495 AbstractCegarLoop]: Abstraction has 4405 states and 6505 transitions. [2022-12-14 07:13:57,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 6505 transitions. [2022-12-14 07:13:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 07:13:57,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:57,229 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] [2022-12-14 07:13:57,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-14 07:13:57,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:57,431 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-12-14 07:13:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:57,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363174165] [2022-12-14 07:13:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:57,436 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:57,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:13:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:57,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:13:57,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:57,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:57,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:57,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363174165] [2022-12-14 07:13:57,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363174165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:57,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:57,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:57,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853493328] [2022-12-14 07:13:57,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:57,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:57,697 INFO L87 Difference]: Start difference. First operand 4405 states and 6505 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:13:57,769 INFO L93 Difference]: Finished difference Result 5317 states and 7249 transitions. [2022-12-14 07:13:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:13:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-12-14 07:13:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:13:57,776 INFO L225 Difference]: With dead ends: 5317 [2022-12-14 07:13:57,776 INFO L226 Difference]: Without dead ends: 5317 [2022-12-14 07:13:57,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:13:57,777 INFO L413 NwaCegarLoop]: 3316 mSDtfsCounter, 1955 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 7976 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:13:57,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 7976 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:13:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2022-12-14 07:13:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 4387. [2022-12-14 07:13:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4387 states, 3525 states have (on average 1.8170212765957447) internal successors, (6405), 4352 states have internal predecessors, (6405), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 07:13:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 6475 transitions. [2022-12-14 07:13:57,819 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 6475 transitions. Word has length 54 [2022-12-14 07:13:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:13:57,819 INFO L495 AbstractCegarLoop]: Abstraction has 4387 states and 6475 transitions. [2022-12-14 07:13:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:13:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 6475 transitions. [2022-12-14 07:13:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 07:13:57,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:13:57,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:13:57,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:13:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:58,021 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:13:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:13:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1318370118, now seen corresponding path program 1 times [2022-12-14 07:13:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:13:58,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553414088] [2022-12-14 07:13:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:13:58,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:13:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:13:58,028 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:13:58,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-14 07:13:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:13:58,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:13:58,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:13:58,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:13:58,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:13:58,233 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 29 treesize of output 38 [2022-12-14 07:13:58,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:13:58,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-12-14 07:13:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:13:58,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:13:58,285 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:13:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553414088] [2022-12-14 07:13:58,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553414088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:13:58,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:13:58,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:13:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730616261] [2022-12-14 07:13:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:13:58,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:13:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:13:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:13:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:13:58,286 INFO L87 Difference]: Start difference. First operand 4387 states and 6475 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:00,367 INFO L93 Difference]: Finished difference Result 4494 states and 6588 transitions. [2022-12-14 07:14:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:14:00,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-14 07:14:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:00,372 INFO L225 Difference]: With dead ends: 4494 [2022-12-14 07:14:00,372 INFO L226 Difference]: Without dead ends: 4494 [2022-12-14 07:14:00,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:14:00,373 INFO L413 NwaCegarLoop]: 1889 mSDtfsCounter, 910 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:00,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 4831 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 07:14:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2022-12-14 07:14:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4353. [2022-12-14 07:14:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4353 states, 3491 states have (on average 1.8246920653107992) internal successors, (6370), 4318 states have internal predecessors, (6370), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 07:14:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 6440 transitions. [2022-12-14 07:14:00,403 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 6440 transitions. Word has length 57 [2022-12-14 07:14:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:00,403 INFO L495 AbstractCegarLoop]: Abstraction has 4353 states and 6440 transitions. [2022-12-14 07:14:00,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 6440 transitions. [2022-12-14 07:14:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 07:14:00,404 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:00,404 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] [2022-12-14 07:14:00,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-12-14 07:14:00,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:00,605 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-12-14 07:14:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486464657] [2022-12-14 07:14:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:00,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:00,611 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:00,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-12-14 07:14:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:00,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:14:00,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:01,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:01,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486464657] [2022-12-14 07:14:01,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486464657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:01,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:01,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:14:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555707220] [2022-12-14 07:14:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:01,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:14:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:01,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:14:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:14:01,105 INFO L87 Difference]: Start difference. First operand 4353 states and 6440 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:01,273 INFO L93 Difference]: Finished difference Result 5976 states and 8528 transitions. [2022-12-14 07:14:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:14:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-14 07:14:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:01,279 INFO L225 Difference]: With dead ends: 5976 [2022-12-14 07:14:01,279 INFO L226 Difference]: Without dead ends: 5976 [2022-12-14 07:14:01,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:14:01,280 INFO L413 NwaCegarLoop]: 2299 mSDtfsCounter, 1078 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:01,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 4177 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:14:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2022-12-14 07:14:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5425. [2022-12-14 07:14:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5425 states, 4555 states have (on average 1.8010976948408342) internal successors, (8204), 5379 states have internal predecessors, (8204), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-14 07:14:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 8296 transitions. [2022-12-14 07:14:01,335 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 8296 transitions. Word has length 59 [2022-12-14 07:14:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 5425 states and 8296 transitions. [2022-12-14 07:14:01,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 8296 transitions. [2022-12-14 07:14:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 07:14:01,335 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:01,335 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] [2022-12-14 07:14:01,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-12-14 07:14:01,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:01,537 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-12-14 07:14:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:01,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896831397] [2022-12-14 07:14:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:01,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:01,542 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:01,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:14:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:01,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:14:01,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:01,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:14:01,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:14:02,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:14:02,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 07:14:02,205 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:14:02,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:14:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:02,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:02,216 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:02,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896831397] [2022-12-14 07:14:02,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896831397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:02,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:02,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:14:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538134728] [2022-12-14 07:14:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:02,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:14:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:02,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:14:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:14:02,218 INFO L87 Difference]: Start difference. First operand 5425 states and 8296 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:06,660 INFO L93 Difference]: Finished difference Result 7844 states and 12019 transitions. [2022-12-14 07:14:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:14:06,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-14 07:14:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:06,666 INFO L225 Difference]: With dead ends: 7844 [2022-12-14 07:14:06,666 INFO L226 Difference]: Without dead ends: 7844 [2022-12-14 07:14:06,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:14:06,667 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 4008 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4022 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:06,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4022 Valid, 1359 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-12-14 07:14:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-12-14 07:14:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 5185. [2022-12-14 07:14:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 4399 states have (on average 1.7328938395089792) internal successors, (7623), 5139 states have internal predecessors, (7623), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-14 07:14:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7715 transitions. [2022-12-14 07:14:06,711 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 7715 transitions. Word has length 62 [2022-12-14 07:14:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:06,712 INFO L495 AbstractCegarLoop]: Abstraction has 5185 states and 7715 transitions. [2022-12-14 07:14:06,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 7715 transitions. [2022-12-14 07:14:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:14:06,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:06,712 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 07:14:06,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:14:06,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:06,913 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-12-14 07:14:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:06,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483740849] [2022-12-14 07:14:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:06,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:06,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:06,919 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:06,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Waiting until timeout for monitored process [2022-12-14 07:14:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:07,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:14:07,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:07,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:14:07,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:07,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 07:14:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:07,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:07,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:07,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483740849] [2022-12-14 07:14:07,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483740849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:07,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:07,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:14:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258840754] [2022-12-14 07:14:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:07,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:14:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:14:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:14:07,312 INFO L87 Difference]: Start difference. First operand 5185 states and 7715 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:11,153 INFO L93 Difference]: Finished difference Result 5184 states and 7712 transitions. [2022-12-14 07:14:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:14:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-14 07:14:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:11,158 INFO L225 Difference]: With dead ends: 5184 [2022-12-14 07:14:11,159 INFO L226 Difference]: Without dead ends: 5184 [2022-12-14 07:14:11,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:14:11,159 INFO L413 NwaCegarLoop]: 1922 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:11,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5098 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 07:14:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2022-12-14 07:14:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 5184. [2022-12-14 07:14:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4399 states have (on average 1.7322118663332575) internal successors, (7620), 5138 states have internal predecessors, (7620), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-14 07:14:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7712 transitions. [2022-12-14 07:14:11,209 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7712 transitions. Word has length 67 [2022-12-14 07:14:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:11,209 INFO L495 AbstractCegarLoop]: Abstraction has 5184 states and 7712 transitions. [2022-12-14 07:14:11,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7712 transitions. [2022-12-14 07:14:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:14:11,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:11,210 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 07:14:11,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Ended with exit code 0 [2022-12-14 07:14:11,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:11,411 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-12-14 07:14:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:11,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215742909] [2022-12-14 07:14:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:11,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:11,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:11,417 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:11,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-12-14 07:14:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:11,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:14:11,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:11,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:14:11,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:11,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:11,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-14 07:14:11,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:14:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:11,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:11,745 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:11,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215742909] [2022-12-14 07:14:11,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215742909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:11,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:11,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:14:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829289584] [2022-12-14 07:14:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:11,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:14:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:14:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:14:11,746 INFO L87 Difference]: Start difference. First operand 5184 states and 7712 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:17,796 INFO L93 Difference]: Finished difference Result 5183 states and 7709 transitions. [2022-12-14 07:14:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:14:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-14 07:14:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:17,801 INFO L225 Difference]: With dead ends: 5183 [2022-12-14 07:14:17,801 INFO L226 Difference]: Without dead ends: 5183 [2022-12-14 07:14:17,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:14:17,801 INFO L413 NwaCegarLoop]: 1922 mSDtfsCounter, 2 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:17,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5087 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-12-14 07:14:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2022-12-14 07:14:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5183. [2022-12-14 07:14:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4396 states have (on average 1.7327115559599635) internal successors, (7617), 5137 states have internal predecessors, (7617), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-14 07:14:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7709 transitions. [2022-12-14 07:14:17,842 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7709 transitions. Word has length 67 [2022-12-14 07:14:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:17,842 INFO L495 AbstractCegarLoop]: Abstraction has 5183 states and 7709 transitions. [2022-12-14 07:14:17,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7709 transitions. [2022-12-14 07:14:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:14:17,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:17,843 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 07:14:17,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-12-14 07:14:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:18,044 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-12-14 07:14:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:18,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919808097] [2022-12-14 07:14:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:18,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:18,050 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:18,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:14:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:18,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:14:18,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:18,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:14:18,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:18,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 07:14:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:18,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:18,462 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:18,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919808097] [2022-12-14 07:14:18,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919808097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:18,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:18,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:14:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115981378] [2022-12-14 07:14:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:14:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:14:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:14:18,463 INFO L87 Difference]: Start difference. First operand 5183 states and 7709 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:22,544 INFO L93 Difference]: Finished difference Result 5182 states and 7705 transitions. [2022-12-14 07:14:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:14:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-14 07:14:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:22,549 INFO L225 Difference]: With dead ends: 5182 [2022-12-14 07:14:22,549 INFO L226 Difference]: Without dead ends: 5182 [2022-12-14 07:14:22,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:14:22,550 INFO L413 NwaCegarLoop]: 1920 mSDtfsCounter, 4 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5093 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:22,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5093 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-12-14 07:14:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2022-12-14 07:14:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5182. [2022-12-14 07:14:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 4396 states have (on average 1.7318016378525933) internal successors, (7613), 5136 states have internal predecessors, (7613), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-14 07:14:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 7705 transitions. [2022-12-14 07:14:22,584 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 7705 transitions. Word has length 67 [2022-12-14 07:14:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:22,585 INFO L495 AbstractCegarLoop]: Abstraction has 5182 states and 7705 transitions. [2022-12-14 07:14:22,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 7705 transitions. [2022-12-14 07:14:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:14:22,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:22,585 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 07:14:22,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:14:22,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:22,786 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-12-14 07:14:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:22,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187443] [2022-12-14 07:14:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:22,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:22,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:22,792 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:22,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Waiting until timeout for monitored process [2022-12-14 07:14:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:23,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:14:23,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:23,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:14:23,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:23,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:23,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:14:23,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-14 07:14:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:23,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:23,369 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:23,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187443] [2022-12-14 07:14:23,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:23,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:23,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:14:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96375763] [2022-12-14 07:14:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:23,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:14:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:23,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:14:23,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:14:23,370 INFO L87 Difference]: Start difference. First operand 5182 states and 7705 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:29,056 INFO L93 Difference]: Finished difference Result 5181 states and 7701 transitions. [2022-12-14 07:14:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:14:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-14 07:14:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:29,062 INFO L225 Difference]: With dead ends: 5181 [2022-12-14 07:14:29,062 INFO L226 Difference]: Without dead ends: 5181 [2022-12-14 07:14:29,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:14:29,062 INFO L413 NwaCegarLoop]: 1920 mSDtfsCounter, 2 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:29,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5082 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-12-14 07:14:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2022-12-14 07:14:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 5181. [2022-12-14 07:14:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 4392 states have (on average 1.7324681238615665) internal successors, (7609), 5135 states have internal predecessors, (7609), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-14 07:14:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7701 transitions. [2022-12-14 07:14:29,113 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7701 transitions. Word has length 67 [2022-12-14 07:14:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:29,113 INFO L495 AbstractCegarLoop]: Abstraction has 5181 states and 7701 transitions. [2022-12-14 07:14:29,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:14:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7701 transitions. [2022-12-14 07:14:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 07:14:29,115 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:29,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:14:29,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Ended with exit code 0 [2022-12-14 07:14:29,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:29,316 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1662288335, now seen corresponding path program 1 times [2022-12-14 07:14:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:29,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165774030] [2022-12-14 07:14:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:29,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:29,322 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:29,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-12-14 07:14:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:29,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:14:29,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:29,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:14:29,613 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165774030] [2022-12-14 07:14:29,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165774030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:14:29,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:14:29,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:14:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135723822] [2022-12-14 07:14:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:14:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:14:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:14:29,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:14:29,615 INFO L87 Difference]: Start difference. First operand 5181 states and 7701 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 07:14:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:29,670 INFO L93 Difference]: Finished difference Result 5184 states and 7710 transitions. [2022-12-14 07:14:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:14:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-12-14 07:14:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:29,678 INFO L225 Difference]: With dead ends: 5184 [2022-12-14 07:14:29,678 INFO L226 Difference]: Without dead ends: 5184 [2022-12-14 07:14:29,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:14:29,679 INFO L413 NwaCegarLoop]: 1919 mSDtfsCounter, 2 mSDsluCounter, 3830 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5749 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 07:14:29,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5749 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:14:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2022-12-14 07:14:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 5184. [2022-12-14 07:14:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4394 states have (on average 1.732362312243969) internal successors, (7612), 5138 states have internal predecessors, (7612), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-12-14 07:14:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7710 transitions. [2022-12-14 07:14:29,722 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7710 transitions. Word has length 75 [2022-12-14 07:14:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:29,722 INFO L495 AbstractCegarLoop]: Abstraction has 5184 states and 7710 transitions. [2022-12-14 07:14:29,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 07:14:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7710 transitions. [2022-12-14 07:14:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 07:14:29,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:29,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:14:29,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-12-14 07:14:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:29,924 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -862868416, now seen corresponding path program 1 times [2022-12-14 07:14:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082654838] [2022-12-14 07:14:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:29,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:29,925 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:29,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 07:14:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:30,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:14:30,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:30,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:30,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:30,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082654838] [2022-12-14 07:14:30,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082654838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:14:30,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581419190] [2022-12-14 07:14:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:14:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:14:30,269 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:14:30,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-14 07:14:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:30,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:14:30,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:30,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:30,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [581419190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:14:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803823219] [2022-12-14 07:14:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:14:30,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:14:30,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:14:30,843 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:14:30,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 07:14:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:14:31,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:14:31,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:31,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:31,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803823219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:14:31,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 07:14:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 07:14:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775641103] [2022-12-14 07:14:31,186 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 07:14:31,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:14:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:14:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:14:31,187 INFO L87 Difference]: Start difference. First operand 5184 states and 7710 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 07:14:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:14:31,364 INFO L93 Difference]: Finished difference Result 5196 states and 7732 transitions. [2022-12-14 07:14:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:14:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-12-14 07:14:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:14:31,370 INFO L225 Difference]: With dead ends: 5196 [2022-12-14 07:14:31,371 INFO L226 Difference]: Without dead ends: 5196 [2022-12-14 07:14:31,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:14:31,371 INFO L413 NwaCegarLoop]: 1919 mSDtfsCounter, 11 mSDsluCounter, 3831 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5750 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:14:31,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5750 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:14:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2022-12-14 07:14:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5194. [2022-12-14 07:14:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 4403 states have (on average 1.7322280263456733) internal successors, (7627), 5147 states have internal predecessors, (7627), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-12-14 07:14:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 7725 transitions. [2022-12-14 07:14:31,420 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 7725 transitions. Word has length 76 [2022-12-14 07:14:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:14:31,420 INFO L495 AbstractCegarLoop]: Abstraction has 5194 states and 7725 transitions. [2022-12-14 07:14:31,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 07:14:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 7725 transitions. [2022-12-14 07:14:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-14 07:14:31,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:14:31,421 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:14:31,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-12-14 07:14:31,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 07:14:31,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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)] Ended with exit code 0 [2022-12-14 07:14:32,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:14:32,022 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:14:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:14:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1849955855, now seen corresponding path program 2 times [2022-12-14 07:14:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:14:32,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043318549] [2022-12-14 07:14:32,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:14:32,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 07:14:32,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:14:32,029 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:14:32,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (34)] Waiting until timeout for monitored process [2022-12-14 07:14:32,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:14:32,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:14:32,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:14:32,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:32,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:32,786 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:14:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043318549] [2022-12-14 07:14:32,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043318549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:14:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [853963143] [2022-12-14 07:14:32,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:14:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:14:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:14:32,788 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:14:32,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-12-14 07:14:34,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:14:34,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:14:34,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:14:34,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:34,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:14:34,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [853963143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:14:34,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344786053] [2022-12-14 07:14:34,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:14:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:14:34,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:14:34,435 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:14:34,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 07:14:46,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:14:46,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:14:46,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 07:14:46,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:14:46,801 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:14:46,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:14:46,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:14:47,178 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:14:47,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 07:14:47,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 07:14:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:14:47,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:14:47,369 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 07:14:47,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 07:14:47,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2339) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-12-14 07:14:47,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344786053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:14:47,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 07:14:47,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 07:14:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598161896] [2022-12-14 07:14:47,379 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 07:14:47,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 07:14:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:14:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 07:14:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-12-14 07:14:47,380 INFO L87 Difference]: Start difference. First operand 5194 states and 7725 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:15:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:14,006 INFO L93 Difference]: Finished difference Result 13288 states and 20556 transitions. [2022-12-14 07:15:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 07:15:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 79 [2022-12-14 07:15:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:14,025 INFO L225 Difference]: With dead ends: 13288 [2022-12-14 07:15:14,025 INFO L226 Difference]: Without dead ends: 13284 [2022-12-14 07:15:14,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-12-14 07:15:14,026 INFO L413 NwaCegarLoop]: 1761 mSDtfsCounter, 4263 mSDsluCounter, 27651 mSDsCounter, 0 mSdLazyCounter, 22161 mSolverCounterSat, 89 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 29412 SdHoareTripleChecker+Invalid, 22255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 22161 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:14,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 29412 Invalid, 22255 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 22161 Invalid, 5 Unknown, 0 Unchecked, 25.2s Time] [2022-12-14 07:15:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2022-12-14 07:15:14,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 5202. [2022-12-14 07:15:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5202 states, 4412 states have (on average 1.7307343608340888) internal successors, (7636), 5155 states have internal predecessors, (7636), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-12-14 07:15:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 7734 transitions. [2022-12-14 07:15:14,097 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 7734 transitions. Word has length 79 [2022-12-14 07:15:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:14,097 INFO L495 AbstractCegarLoop]: Abstraction has 5202 states and 7734 transitions. [2022-12-14 07:15:14,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:15:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 7734 transitions. [2022-12-14 07:15:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 07:15:14,098 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:14,098 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:14,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 07:15:14,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-12-14 07:15:14,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (34)] Ended with exit code 0 [2022-12-14 07:15:14,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:15:14,699 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:15:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1877690256, now seen corresponding path program 1 times [2022-12-14 07:15:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:15:14,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415286616] [2022-12-14 07:15:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:14,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:15:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:15:14,702 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:15:14,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (37)] Waiting until timeout for monitored process [2022-12-14 07:15:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:15,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:15:15,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:15,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:15,678 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:15:15,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415286616] [2022-12-14 07:15:15,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415286616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:15,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1840761740] [2022-12-14 07:15:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:15:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:15:15,679 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:15:15,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-12-14 07:15:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:15:16,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:16,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:16,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1840761740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:16,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624858471] [2022-12-14 07:15:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:16,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:16,444 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:16,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 07:15:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 07:15:16,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:16,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:17,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624858471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:17,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 07:15:17,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 07:15:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498086730] [2022-12-14 07:15:17,589 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 07:15:17,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 07:15:17,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:15:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 07:15:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 07:15:17,591 INFO L87 Difference]: Start difference. First operand 5202 states and 7734 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:15:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:20,536 INFO L93 Difference]: Finished difference Result 5244 states and 7836 transitions. [2022-12-14 07:15:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 07:15:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2022-12-14 07:15:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:20,548 INFO L225 Difference]: With dead ends: 5244 [2022-12-14 07:15:20,548 INFO L226 Difference]: Without dead ends: 5238 [2022-12-14 07:15:20,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 07:15:20,550 INFO L413 NwaCegarLoop]: 1925 mSDtfsCounter, 65 mSDsluCounter, 21134 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 23059 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:20,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 23059 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 07:15:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2022-12-14 07:15:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5220. [2022-12-14 07:15:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5220 states, 4430 states have (on average 1.7288939051918737) internal successors, (7659), 5173 states have internal predecessors, (7659), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-12-14 07:15:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 7757 transitions. [2022-12-14 07:15:20,600 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 7757 transitions. Word has length 85 [2022-12-14 07:15:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:20,601 INFO L495 AbstractCegarLoop]: Abstraction has 5220 states and 7757 transitions. [2022-12-14 07:15:20,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:15:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 7757 transitions. [2022-12-14 07:15:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 07:15:20,602 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:20,602 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:20,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (37)] Ended with exit code 0 [2022-12-14 07:15:20,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 07:15:21,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-12-14 07:15:21,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:15:21,203 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:15:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash -490068688, now seen corresponding path program 2 times [2022-12-14 07:15:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:15:21,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048986204] [2022-12-14 07:15:21,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:15:21,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:15:21,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:15:21,210 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:15:21,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (40)] Waiting until timeout for monitored process [2022-12-14 07:15:21,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:15:21,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:15:21,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 07:15:21,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:22,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:23,616 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:15:23,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048986204] [2022-12-14 07:15:23,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048986204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:23,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2093024345] [2022-12-14 07:15:23,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:15:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:15:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:15:23,617 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:15:23,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-12-14 07:15:25,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:15:25,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:15:25,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 07:15:25,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:25,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:25,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2093024345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:25,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560785534] [2022-12-14 07:15:25,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:15:25,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:25,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:25,585 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:25,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 07:15:35,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:15:35,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:15:35,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 07:15:35,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:36,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:15:36,033 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:15:36,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:15:36,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:15:36,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:15:36,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 07:15:36,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:15:36,451 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:36,461 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:15:36,471 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:36,670 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562)))) is different from true [2022-12-14 07:15:36,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566)))) is different from true [2022-12-14 07:15:36,879 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570)))) is different from true [2022-12-14 07:15:36,979 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:37,104 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:15:37,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587)))) is different from true [2022-12-14 07:15:37,629 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594)))) is different from true [2022-12-14 07:15:37,656 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:37,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:15:37,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:15:37,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 07:15:37,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:15:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 175 not checked. [2022-12-14 07:15:37,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:38,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3641 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-14 07:15:38,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560785534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:38,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 07:15:38,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 19] total 68 [2022-12-14 07:15:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791588105] [2022-12-14 07:15:38,522 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 07:15:38,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-14 07:15:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:15:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-14 07:15:38,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=718, Invalid=2830, Unknown=36, NotChecked=1386, Total=4970 [2022-12-14 07:15:38,523 INFO L87 Difference]: Start difference. First operand 5220 states and 7757 transitions. Second operand has 68 states, 67 states have (on average 2.8955223880597014) internal successors, (194), 68 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:16:05,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557)))) is different from true [2022-12-14 07:17:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:17:16,648 INFO L93 Difference]: Finished difference Result 14051 states and 21761 transitions. [2022-12-14 07:17:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-12-14 07:17:16,649 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.8955223880597014) internal successors, (194), 68 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2022-12-14 07:17:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:17:16,664 INFO L225 Difference]: With dead ends: 14051 [2022-12-14 07:17:16,664 INFO L226 Difference]: Without dead ends: 14035 [2022-12-14 07:17:16,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 404 SyntacticMatches, 13 SemanticMatches, 192 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 8074 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=6560, Invalid=26337, Unknown=93, NotChecked=4452, Total=37442 [2022-12-14 07:17:16,669 INFO L413 NwaCegarLoop]: 2036 mSDtfsCounter, 4128 mSDsluCounter, 54423 mSDsCounter, 0 mSdLazyCounter, 51635 mSolverCounterSat, 219 mSolverCounterUnsat, 1900 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 56459 SdHoareTripleChecker+Invalid, 104010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 51635 IncrementalHoareTripleChecker+Invalid, 1900 IncrementalHoareTripleChecker+Unknown, 50256 IncrementalHoareTripleChecker+Unchecked, 74.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:17:16,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 56459 Invalid, 104010 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [219 Valid, 51635 Invalid, 1900 Unknown, 50256 Unchecked, 74.2s Time] [2022-12-14 07:17:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14035 states. [2022-12-14 07:17:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14035 to 5302. [2022-12-14 07:17:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 4512 states have (on average 1.717863475177305) internal successors, (7751), 5254 states have internal predecessors, (7751), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-12-14 07:17:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 7849 transitions. [2022-12-14 07:17:16,742 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 7849 transitions. Word has length 97 [2022-12-14 07:17:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:17:16,742 INFO L495 AbstractCegarLoop]: Abstraction has 5302 states and 7849 transitions. [2022-12-14 07:17:16,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.8955223880597014) internal successors, (194), 68 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:17:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 7849 transitions. [2022-12-14 07:17:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 07:17:16,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:17:16,743 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:17:16,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-14 07:17:16,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (40)] Ended with exit code 0 [2022-12-14 07:17:17,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-12-14 07:17:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:17:17,344 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:17:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:17:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1550768395, now seen corresponding path program 1 times [2022-12-14 07:17:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:17:17,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426549280] [2022-12-14 07:17:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:17,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:17:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:17:17,349 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:17:17,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (43)] Waiting until timeout for monitored process [2022-12-14 07:17:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:18,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:17:18,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:18,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:17:18,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:17:18,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:17:18,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:17:18,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-12-14 07:17:18,112 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:17:18,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:17:18,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-12-14 07:17:18,247 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 45 treesize of output 41 [2022-12-14 07:17:18,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:17:18,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-12-14 07:17:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-12-14 07:17:18,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:17:18,315 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:17:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426549280] [2022-12-14 07:17:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426549280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:17:18,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:17:18,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 07:17:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299858100] [2022-12-14 07:17:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:17:18,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:17:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:17:18,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:17:18,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:17:18,316 INFO L87 Difference]: Start difference. First operand 5302 states and 7849 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 07:17:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:17:23,429 INFO L93 Difference]: Finished difference Result 5314 states and 7603 transitions. [2022-12-14 07:17:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:17:23,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-12-14 07:17:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:17:23,435 INFO L225 Difference]: With dead ends: 5314 [2022-12-14 07:17:23,436 INFO L226 Difference]: Without dead ends: 5314 [2022-12-14 07:17:23,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:17:23,436 INFO L413 NwaCegarLoop]: 1140 mSDtfsCounter, 1863 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:17:23,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 3754 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-12-14 07:17:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2022-12-14 07:17:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4902. [2022-12-14 07:17:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4113 states have (on average 1.7410649161196208) internal successors, (7161), 4857 states have internal predecessors, (7161), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-12-14 07:17:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7252 transitions. [2022-12-14 07:17:23,471 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7252 transitions. Word has length 119 [2022-12-14 07:17:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:17:23,471 INFO L495 AbstractCegarLoop]: Abstraction has 4902 states and 7252 transitions. [2022-12-14 07:17:23,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 07:17:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7252 transitions. [2022-12-14 07:17:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-14 07:17:23,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:17:23,472 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:17:23,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (43)] Ended with exit code 0 [2022-12-14 07:17:23,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:17:23,672 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:17:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:17:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash -113709607, now seen corresponding path program 1 times [2022-12-14 07:17:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:17:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896001127] [2022-12-14 07:17:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:23,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:17:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:17:23,674 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:17:23,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (44)] Waiting until timeout for monitored process [2022-12-14 07:17:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:24,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:17:24,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:24,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:17:24,473 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:17:24,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 07:17:24,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:17:24,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 07:17:24,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4402) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:24,894 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4410) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:24,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4412) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:25,035 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4416) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:25,202 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4423) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:25,646 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4440) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:17:25,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:25,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 07:17:25,843 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:25,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 07:17:25,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 07:17:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-12-14 07:17:25,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:27,998 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (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_4443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:17:28,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4489 (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~mem39#1.base| v_ArrVal_4489))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:17:28,247 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:17:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896001127] [2022-12-14 07:17:28,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896001127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1001799920] [2022-12-14 07:17:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:28,248 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:17:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:17:28,248 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:17:28,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-12-14 07:17:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:31,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 07:17:31,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:31,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:17:31,530 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:17:31,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 07:17:31,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:17:31,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 07:17:31,912 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878)))) is different from true [2022-12-14 07:17:32,060 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4884)))) is different from true [2022-12-14 07:17:32,712 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908)))) is different from true [2022-12-14 07:17:32,866 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:32,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 07:17:32,937 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:32,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 07:17:32,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 33 treesize of output 15 [2022-12-14 07:17:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-12-14 07:17:32,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:32,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_4913) |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 07:17:32,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4913 (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_4913) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:17:33,246 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4959 (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~mem39#1.base| v_ArrVal_4959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4913)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 07:17:33,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1001799920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:33,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964135811] [2022-12-14 07:17:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:33,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:33,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:17:33,250 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:17:33,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 07:17:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:33,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 07:17:33,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:33,781 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:17:33,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:17:33,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:17:33,925 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) is different from true [2022-12-14 07:17:33,929 WARN L859 $PredicateComparison]: unable to prove that (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 07:17:33,934 WARN L859 $PredicateComparison]: unable to prove that (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))) is different from true [2022-12-14 07:17:33,938 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) is different from true [2022-12-14 07:17:33,942 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:33,947 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5342))) is different from true [2022-12-14 07:17:33,951 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5343))) is different from true [2022-12-14 07:17:33,956 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:33,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345))) is different from true [2022-12-14 07:17:33,964 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346))) is different from true [2022-12-14 07:17:33,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:33,973 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348))) is different from true [2022-12-14 07:17:33,977 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) is different from true [2022-12-14 07:17:33,982 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:33,986 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:33,991 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) is different from true [2022-12-14 07:17:33,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,000 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,005 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) is different from true [2022-12-14 07:17:34,009 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,013 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,018 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,023 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,028 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,032 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) is different from true [2022-12-14 07:17:34,037 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5362))) is different from true [2022-12-14 07:17:34,041 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5363))) is different from true [2022-12-14 07:17:34,046 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5364))) is different from true [2022-12-14 07:17:34,050 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5365) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,054 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5366) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,059 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5367))) is different from true [2022-12-14 07:17:34,063 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5368) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,068 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5369))) is different from true [2022-12-14 07:17:34,072 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5370) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,077 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5371 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5371) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,081 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5372) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,086 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5373))) is different from true [2022-12-14 07:17:34,090 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,095 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) is different from true [2022-12-14 07:17:34,100 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,105 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) is different from true [2022-12-14 07:17:34,110 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,114 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 07:17:34,120 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) is different from true [2022-12-14 07:17:34,141 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:34,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 07:17:34,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:34,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 07:17:34,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 07:17:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 07:17:34,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:34,311 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 07:17:34,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 07:17:34,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5381) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-12-14 07:17:34,626 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5427)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_5381) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-12-14 07:17:34,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964135811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:34,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:17:34,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 54] total 70 [2022-12-14 07:17:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923807872] [2022-12-14 07:17:34,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:17:34,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-14 07:17:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:17:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-14 07:17:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=383, Unknown=91, NotChecked=5820, Total=6480 [2022-12-14 07:17:34,630 INFO L87 Difference]: Start difference. First operand 4902 states and 7252 transitions. Second operand has 71 states, 68 states have (on average 2.764705882352941) internal successors, (188), 71 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:17:35,896 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_4399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4399)))) is different from true [2022-12-14 07:17:35,952 WARN L859 $PredicateComparison]: unable to prove that (and (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_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878))) (exists ((v_ArrVal_4416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4416) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4884))) (exists ((v_ArrVal_4402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4402) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4399))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (exists ((v_ArrVal_4410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4410) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4440) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:18:09,172 INFO L93 Difference]: Finished difference Result 12923 states and 20034 transitions. [2022-12-14 07:18:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-14 07:18:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 68 states have (on average 2.764705882352941) internal successors, (188), 71 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2022-12-14 07:18:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:18:09,187 INFO L225 Difference]: With dead ends: 12923 [2022-12-14 07:18:09,188 INFO L226 Difference]: Without dead ends: 12923 [2022-12-14 07:18:09,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 225 SyntacticMatches, 83 SemanticMatches, 89 ConstructedPredicates, 62 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=269, Invalid=690, Unknown=101, NotChecked=7130, Total=8190 [2022-12-14 07:18:09,189 INFO L413 NwaCegarLoop]: 1811 mSDtfsCounter, 4111 mSDsluCounter, 16859 mSDsCounter, 0 mSdLazyCounter, 14454 mSolverCounterSat, 51 mSolverCounterUnsat, 2651 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4126 SdHoareTripleChecker+Valid, 18670 SdHoareTripleChecker+Invalid, 178342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 14454 IncrementalHoareTripleChecker+Invalid, 2651 IncrementalHoareTripleChecker+Unknown, 161186 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:18:09,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4126 Valid, 18670 Invalid, 178342 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [51 Valid, 14454 Invalid, 2651 Unknown, 161186 Unchecked, 33.4s Time] [2022-12-14 07:18:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12923 states. [2022-12-14 07:18:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12923 to 4901. [2022-12-14 07:18:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 4113 states have (on average 1.7403355215171408) internal successors, (7158), 4856 states have internal predecessors, (7158), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-12-14 07:18:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 7249 transitions. [2022-12-14 07:18:09,261 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 7249 transitions. Word has length 122 [2022-12-14 07:18:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:18:09,261 INFO L495 AbstractCegarLoop]: Abstraction has 4901 states and 7249 transitions. [2022-12-14 07:18:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 68 states have (on average 2.764705882352941) internal successors, (188), 71 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:18:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 7249 transitions. [2022-12-14 07:18:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-14 07:18:09,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:18:09,262 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:18:09,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2022-12-14 07:18:09,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-14 07:18:09,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (44)] Ended with exit code 0 [2022-12-14 07:18:09,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:18:09,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:18:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:18:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash -113709606, now seen corresponding path program 1 times [2022-12-14 07:18:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:18:09,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799334967] [2022-12-14 07:18:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:18:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:18:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:18:09,869 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:18:09,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (47)] Waiting until timeout for monitored process [2022-12-14 07:18:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:18:10,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 07:18:10,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:18:10,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:18:10,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:18:10,918 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:18:10,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:18:10,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:18:10,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:18:11,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 07:18:11,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:18:11,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812)))) is different from true [2022-12-14 07:18:11,113 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:11,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5816))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815)))) is different from true [2022-12-14 07:18:11,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:11,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5819)))) is different from true [2022-12-14 07:18:11,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:18:11,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:11,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828))) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827)))) is different from true [2022-12-14 07:18:11,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5830))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829)))) is different from true [2022-12-14 07:18:11,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5834))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5833) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5835)))) is different from true [2022-12-14 07:18:11,218 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838)))) is different from true [2022-12-14 07:18:11,229 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5840))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-12-14 07:18:11,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5841))) (exists ((v_ArrVal_5842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5842) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:11,245 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5844) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5843)))) is different from true [2022-12-14 07:18:11,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5846))) (exists ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5845))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:18:11,262 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5847))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5848)))) is different from true [2022-12-14 07:18:11,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 07:18:11,279 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5851))) (exists ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5852)))) is different from true [2022-12-14 07:18:11,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,296 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5856))) (exists ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5855) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:18:11,305 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5858))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5857)))) is different from true [2022-12-14 07:18:11,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859)))) is different from true [2022-12-14 07:18:11,323 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:11,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865))) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866)))) is different from true [2022-12-14 07:18:11,360 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868)))) is different from true [2022-12-14 07:18:11,368 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869))) (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,377 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5871))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872)))) is different from true [2022-12-14 07:18:11,385 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5874)))) is different from true [2022-12-14 07:18:11,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5875))) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876)))) is different from true [2022-12-14 07:18:11,401 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5878))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5877)))) is different from true [2022-12-14 07:18:11,409 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:18:11,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882)))) is different from true [2022-12-14 07:18:11,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883)))) is different from true [2022-12-14 07:18:11,437 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5886))) (exists ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5885)))) is different from true [2022-12-14 07:18:11,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:18:11,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890)))) is different from true [2022-12-14 07:18:11,467 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5891))) (exists ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5892) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:18:11,477 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5893) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5894)))) is different from true [2022-12-14 07:18:11,489 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5895))) (exists ((v_ArrVal_5896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5896)))) is different from true [2022-12-14 07:18:11,531 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:18:11,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:18:11,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:18:11,626 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:18:11,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:18:11,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:18:11,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 07:18:11,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:18:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-14 07:18:11,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:18:11,828 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 07:18:11,856 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_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 07:18:12,547 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5990) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5989))) (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~mem39#1.base| v_ArrVal_5990) .cse2 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 07:18:12,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:18:12,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799334967] [2022-12-14 07:18:12,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799334967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:18:12,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [451578357] [2022-12-14 07:18:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:18:12,556 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:18:12,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:18:12,556 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:18:12,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-12-14 07:20:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 07:20:13,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:13,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:20:13,806 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:20:13,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:20:13,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:20:13,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:13,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:13,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 07:20:13,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:20:13,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6372))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6373)))) is different from true [2022-12-14 07:20:13,953 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6375)))) is different from true [2022-12-14 07:20:13,964 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6377))) (exists ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6376)))) is different from true [2022-12-14 07:20:13,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6379))) (exists ((v_ArrVal_6378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6378) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:13,986 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6380))) (exists ((v_ArrVal_6381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6381) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:13,998 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6383) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6382)))) is different from true [2022-12-14 07:20:14,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6384))) (exists ((v_ArrVal_6385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6385)))) is different from true [2022-12-14 07:20:14,022 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6386))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:14,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6388) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6389)))) is different from true [2022-12-14 07:20:14,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6390) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6391)))) is different from true [2022-12-14 07:20:14,058 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6392))) (exists ((v_ArrVal_6393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6393)))) is different from true [2022-12-14 07:20:14,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6394))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:14,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6397))) (exists ((v_ArrVal_6396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6396) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:14,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6398))) (exists ((v_ArrVal_6399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6399)))) is different from true [2022-12-14 07:20:14,104 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6400) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6401)))) is different from true [2022-12-14 07:20:14,116 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6402) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6403)))) is different from true [2022-12-14 07:20:14,127 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6404) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6405) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:14,138 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6407))) (exists ((v_ArrVal_6406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6406)))) is different from true [2022-12-14 07:20:14,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6409) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:14,159 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6411) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6410)))) is different from true [2022-12-14 07:20:14,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6413))) (exists ((v_ArrVal_6412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6412)))) is different from true [2022-12-14 07:20:14,178 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6414))) (exists ((v_ArrVal_6415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6415))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:14,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6416))) (exists ((v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6417) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:14,196 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6419))) (exists ((v_ArrVal_6418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6418)))) is different from true [2022-12-14 07:20:14,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6420))) (exists ((v_ArrVal_6421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6421)))) is different from true [2022-12-14 07:20:14,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6423))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6422) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:14,225 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6425) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6424)))) is different from true [2022-12-14 07:20:14,234 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6427) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6426)))) is different from true [2022-12-14 07:20:14,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6428))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6429)))) is different from true [2022-12-14 07:20:14,253 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6430))) (exists ((v_ArrVal_6431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6431)))) is different from true [2022-12-14 07:20:14,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6432 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6432) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6433) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:14,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6434))) (exists ((v_ArrVal_6435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6435)))) is different from true [2022-12-14 07:20:14,282 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6437))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6436) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:14,291 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6438) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6439) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:14,301 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6441))) (exists ((v_ArrVal_6440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6440) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:14,310 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6443)))) is different from true [2022-12-14 07:20:14,320 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6445))) (exists ((v_ArrVal_6444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6444)))) is different from true [2022-12-14 07:20:14,333 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6446))) (exists ((v_ArrVal_6447 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6447) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:14,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6449))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6448)))) is different from true [2022-12-14 07:20:14,349 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6450))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6451)))) is different from true [2022-12-14 07:20:14,357 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6452))) (exists ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6453) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:14,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6454))) (exists ((v_ArrVal_6455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6455) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:14,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6457))) (exists ((v_ArrVal_6456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6456)))) is different from true [2022-12-14 07:20:14,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6459) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6458)))) is different from true [2022-12-14 07:20:14,416 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:20:14,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:20:14,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:20:14,480 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:20:14,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:20:14,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:20:14,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 07:20:14,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:20:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 07:20:14,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:14,575 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 07:20:14,605 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_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 07:20:15,308 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6552))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6553) .cse0 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6553) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6461) |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 07:20:15,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [451578357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:15,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115926930] [2022-12-14 07:20:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:15,322 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:15,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 07:20:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:15,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 07:20:15,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:15,877 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:20:15,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:20:15,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:20:15,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:15,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:15,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 07:20:15,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:20:15,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935)))) is different from true [2022-12-14 07:20:16,005 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6937) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6936)))) is different from true [2022-12-14 07:20:16,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939)))) is different from true [2022-12-14 07:20:16,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:16,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942)))) is different from true [2022-12-14 07:20:16,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6944))) (exists ((v_ArrVal_6945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6945) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:16,055 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949)))) is different from true [2022-12-14 07:20:16,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951)))) is different from true [2022-12-14 07:20:16,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6952))) (exists ((v_ArrVal_6953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6953) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:16,090 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954))) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955)))) is different from true [2022-12-14 07:20:16,099 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956)))) is different from true [2022-12-14 07:20:16,109 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958)))) is different from true [2022-12-14 07:20:16,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962)))) is different from true [2022-12-14 07:20:16,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6964))) (exists ((v_ArrVal_6965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6965) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,145 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966)))) is different from true [2022-12-14 07:20:16,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969)))) is different from true [2022-12-14 07:20:16,162 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:16,171 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6972))) (exists ((v_ArrVal_6973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6973)))) is different from true [2022-12-14 07:20:16,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6975))) (exists ((v_ArrVal_6974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6974)))) is different from true [2022-12-14 07:20:16,190 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6976))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6977)))) is different from true [2022-12-14 07:20:16,199 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:16,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983)))) is different from true [2022-12-14 07:20:16,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6985)))) is different from true [2022-12-14 07:20:16,233 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:16,242 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989)))) is different from true [2022-12-14 07:20:16,250 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:16,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6993)))) is different from true [2022-12-14 07:20:16,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6997) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6996)))) is different from true [2022-12-14 07:20:16,284 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6999))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6998)))) is different from true [2022-12-14 07:20:16,292 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7001))) (exists ((v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7000) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,301 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7003) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7002)))) is different from true [2022-12-14 07:20:16,310 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7005))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7004) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7006))) (exists ((v_ArrVal_7007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7007)))) is different from true [2022-12-14 07:20:16,327 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7009) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7008)))) is different from true [2022-12-14 07:20:16,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7010))) (exists ((v_ArrVal_7011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7011))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:16,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7012))) (exists ((v_ArrVal_7013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7013) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:16,353 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7014))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 07:20:16,361 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7017))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016)))) is different from true [2022-12-14 07:20:16,370 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7018)))) is different from true [2022-12-14 07:20:16,379 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021)))) is different from true [2022-12-14 07:20:16,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:20:16,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:20:16,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:20:16,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:20:16,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:20:16,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:20:16,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 07:20:16,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:20:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 07:20:16,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:16,562 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 07:20:16,592 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_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 07:20:17,263 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7115))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7114) .cse0 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7114) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7022) |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 07:20:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115926930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:17,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:17,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 53] total 141 [2022-12-14 07:20:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126640068] [2022-12-14 07:20:17,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:17,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-12-14 07:20:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:20:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-12-14 07:20:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=261, Unknown=146, NotChecked=22540, Total=23256 [2022-12-14 07:20:17,273 INFO L87 Difference]: Start difference. First operand 4901 states and 7249 transitions. Second operand has 142 states, 140 states have (on average 1.7428571428571429) internal successors, (244), 142 states have internal predecessors, (244), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:20:18,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809))) (exists ((v_ArrVal_6372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6372))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6373)))) is different from true [2022-12-14 07:20:18,109 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6937) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6375))) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6936)))) is different from true [2022-12-14 07:20:18,113 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6377))) (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6376)))) is different from true [2022-12-14 07:20:18,116 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5816))) (exists ((v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6379))) (exists ((v_ArrVal_6378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6378) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815))) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6380))) (exists ((v_ArrVal_6381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6381) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,124 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6383) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6944))) (exists ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6382))) (exists ((v_ArrVal_5819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5819))) (exists ((v_ArrVal_6945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6945) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6384))) (exists ((v_ArrVal_6385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6385))) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:18,132 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_ArrVal_6387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6386))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949)))) is different from true [2022-12-14 07:20:18,136 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6388) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6389))) (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951)))) is different from true [2022-12-14 07:20:18,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6952))) (exists ((v_ArrVal_6953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6953) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828))) (exists ((v_ArrVal_6391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6391))) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827)))) is different from true [2022-12-14 07:20:18,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5830))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954))) (exists ((v_ArrVal_6392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6392))) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_6393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6393)))) is different from true [2022-12-14 07:20:18,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_6395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6395) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6394))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:18,152 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959))) (exists ((v_ArrVal_6397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6397))) (exists ((v_ArrVal_6396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6396) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5834))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5833) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958)))) is different from true [2022-12-14 07:20:18,156 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836))) (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5835))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6398))) (exists ((v_ArrVal_6399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6399)))) is different from true [2022-12-14 07:20:18,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6400) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_ArrVal_6401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6401)))) is different from true [2022-12-14 07:20:18,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6964))) (exists ((v_ArrVal_6402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6402) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5840))) (exists ((v_ArrVal_6965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6965) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6403))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-12-14 07:20:18,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6404) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966))) (exists ((v_ArrVal_6405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5841))) (exists ((v_ArrVal_5842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5842) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5844) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6407))) (exists ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5843))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6406))) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969)))) is different from true [2022-12-14 07:20:18,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5846))) (exists ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5845))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6409) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5847))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6972))) (exists ((v_ArrVal_6410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6410))) (exists ((v_ArrVal_5848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5848))) (exists ((v_ArrVal_6973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6973)))) is different from true [2022-12-14 07:20:18,184 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6413))) (exists ((v_ArrVal_6975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6975))) (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6412))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850))) (exists ((v_ArrVal_6974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6974)))) is different from true [2022-12-14 07:20:18,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6414))) (exists ((v_ArrVal_6415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6415))) (exists ((v_ArrVal_6976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6976))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5851))) (exists ((v_ArrVal_6977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6977))) (exists ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5852)))) is different from true [2022-12-14 07:20:18,191 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6416))) (exists ((v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6417) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5856))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5855) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6419))) (exists ((v_ArrVal_6418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6418)))) is different from true [2022-12-14 07:20:18,199 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5858))) (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6420))) (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5857))) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983))) (exists ((v_ArrVal_6421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6421)))) is different from true [2022-12-14 07:20:18,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6423))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6985))) (exists ((v_ArrVal_6422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6422) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859)))) is different from true [2022-12-14 07:20:18,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862))) (exists ((v_ArrVal_6425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6425) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6424))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6427) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6426)))) is different from true [2022-12-14 07:20:18,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6428))) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865))) (exists ((v_ArrVal_6429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6429))) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6993))) (exists ((v_ArrVal_6430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6430))) (exists ((v_ArrVal_6431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6431))) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868)))) is different from true [2022-12-14 07:20:18,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6432 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6432) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6433) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:18,228 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6997) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5871))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6996))) (exists ((v_ArrVal_6434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6434))) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872))) (exists ((v_ArrVal_6435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6435)))) is different from true [2022-12-14 07:20:18,232 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6437))) (exists ((v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6999))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5874))) (exists ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6998))) (exists ((v_ArrVal_6436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6436) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:20:18,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6438) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7001))) (exists ((v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5875))) (exists ((v_ArrVal_6439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6439) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7000) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876)))) is different from true [2022-12-14 07:20:18,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5878))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5877))) (exists ((v_ArrVal_6441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6441))) (exists ((v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7002))) (exists ((v_ArrVal_6440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6440) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:18,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880))) (exists ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7005))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7004) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6443))) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:20:18,248 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6445))) (exists ((v_ArrVal_6444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6444))) (exists ((v_ArrVal_7006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7006))) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882))) (exists ((v_ArrVal_7007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7007)))) is different from true [2022-12-14 07:20:18,252 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_ArrVal_7009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7009) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6446))) (exists ((v_ArrVal_7008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7008))) (exists ((v_ArrVal_6447 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6447) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883)))) is different from true [2022-12-14 07:20:18,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7010))) (exists ((v_ArrVal_7011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7011))) (exists ((v_ArrVal_6449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6449))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5886))) (exists ((v_ArrVal_6448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6448))) (exists ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5885)))) is different from true [2022-12-14 07:20:18,259 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6450))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7012))) (exists ((v_ArrVal_7013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7013) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6451)))) is different from true [2022-12-14 07:20:18,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6452))) (exists ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6453) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7014))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890)))) is different from true [2022-12-14 07:20:18,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6454))) (exists ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5891))) (exists ((v_ArrVal_6455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6455) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7017))) (exists ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5892) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016)))) is different from true [2022-12-14 07:20:18,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5893) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5894))) (exists ((v_ArrVal_6457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6457))) (exists ((v_ArrVal_6456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6456))) (exists ((v_ArrVal_7018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7018)))) is different from true [2022-12-14 07:20:18,276 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6459) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5895))) (exists ((v_ArrVal_5896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5896))) (exists ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6458))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021)))) is different from true [2022-12-14 07:20:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:49,797 INFO L93 Difference]: Finished difference Result 13569 states and 20849 transitions. [2022-12-14 07:20:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-14 07:20:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 140 states have (on average 1.7428571428571429) internal successors, (244), 142 states have internal predecessors, (244), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2022-12-14 07:20:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:49,810 INFO L225 Difference]: With dead ends: 13569 [2022-12-14 07:20:49,810 INFO L226 Difference]: Without dead ends: 13569 [2022-12-14 07:20:49,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 204 ConstructedPredicates, 184 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=462, Invalid=538, Unknown=198, NotChecked=41032, Total=42230 [2022-12-14 07:20:49,813 INFO L413 NwaCegarLoop]: 1942 mSDtfsCounter, 4170 mSDsluCounter, 9320 mSDsCounter, 0 mSdLazyCounter, 13834 mSolverCounterSat, 31 mSolverCounterUnsat, 1273 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4183 SdHoareTripleChecker+Valid, 11262 SdHoareTripleChecker+Invalid, 580087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13834 IncrementalHoareTripleChecker+Invalid, 1273 IncrementalHoareTripleChecker+Unknown, 564949 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:49,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4183 Valid, 11262 Invalid, 580087 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [31 Valid, 13834 Invalid, 1273 Unknown, 564949 Unchecked, 30.6s Time] [2022-12-14 07:20:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13569 states. [2022-12-14 07:20:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13569 to 4922. [2022-12-14 07:20:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4922 states, 4133 states have (on average 1.7369949189450762) internal successors, (7179), 4874 states have internal predecessors, (7179), 43 states have call successors, (43), 5 states have call predecessors, (43), 7 states have return successors, (51), 43 states have call predecessors, (51), 43 states have call successors, (51) [2022-12-14 07:20:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4922 states to 4922 states and 7273 transitions. [2022-12-14 07:20:49,886 INFO L78 Accepts]: Start accepts. Automaton has 4922 states and 7273 transitions. Word has length 122 [2022-12-14 07:20:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:49,886 INFO L495 AbstractCegarLoop]: Abstraction has 4922 states and 7273 transitions. [2022-12-14 07:20:49,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 140 states have (on average 1.7428571428571429) internal successors, (244), 142 states have internal predecessors, (244), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:20:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4922 states and 7273 transitions. [2022-12-14 07:20:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 07:20:49,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:49,887 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:49,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-12-14 07:20:50,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (47)] Forceful destruction successful, exit code 0 [2022-12-14 07:20:50,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-14 07:20:50,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:50,489 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:20:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash 991688521, now seen corresponding path program 2 times [2022-12-14 07:20:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:20:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395160850] [2022-12-14 07:20:50,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:20:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:20:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:20:50,493 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:20:50,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (50)] Waiting until timeout for monitored process [2022-12-14 07:20:51,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:20:51,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:20:51,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:20:51,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:52,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:59,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:20:59,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395160850] [2022-12-14 07:20:59,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395160850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:59,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1055749005] [2022-12-14 07:20:59,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:20:59,250 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:20:59,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:20:59,251 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:20:59,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-12-14 07:21:01,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:21:01,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:21:01,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 07:21:01,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:21:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:21:01,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:21:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:21:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1055749005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:21:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228558393] [2022-12-14 07:21:02,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:21:02,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:21:02,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:21:02,401 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:21:02,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-14 07:22:25,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:22:25,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:22:25,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 07:22:25,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:22:25,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:22:25,853 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:22:25,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-14 07:22:25,877 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:22:25,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:22:26,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:22:26,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:22:26,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-14 07:22:26,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:22:30,735 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv72 32))) (exists ((v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8285) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:22:32,065 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv72 32))) (exists ((v_ArrVal_8294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8294)))) is different from true [2022-12-14 07:22:34,110 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv72 32))) (exists ((v_ArrVal_8305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8305)))) is different from true [2022-12-14 07:22:34,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|) (_ bv72 32))) (exists ((v_ArrVal_8309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8309)))) is different from true [2022-12-14 07:22:34,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:22:35,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:22:35,028 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 07:22:35,045 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 07:22:35,046 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 100 treesize of output 66 [2022-12-14 07:22:35,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:22:35,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-12-14 07:22:35,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 07:22:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 174 not checked. [2022-12-14 07:22:35,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:22:37,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-12-14 07:22:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228558393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:22:46,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 07:22:46,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48, 48, 17] total 110 [2022-12-14 07:22:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350867012] [2022-12-14 07:22:46,950 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 07:22:46,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-12-14 07:22:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:22:46,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-12-14 07:22:46,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1374, Invalid=10770, Unknown=82, NotChecked=884, Total=13110 [2022-12-14 07:22:46,952 INFO L87 Difference]: Start difference. First operand 4922 states and 7273 transitions. Second operand has 110 states, 109 states have (on average 2.293577981651376) internal successors, (250), 110 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:25:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:25:22,016 INFO L93 Difference]: Finished difference Result 13085 states and 20403 transitions. [2022-12-14 07:25:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-12-14 07:25:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 109 states have (on average 2.293577981651376) internal successors, (250), 110 states have internal predecessors, (250), 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 123 [2022-12-14 07:25:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:25:22,029 INFO L225 Difference]: With dead ends: 13085 [2022-12-14 07:25:22,029 INFO L226 Difference]: Without dead ends: 13079 [2022-12-14 07:25:22,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 467 SyntacticMatches, 83 SemanticMatches, 261 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19067 ImplicationChecksByTransitivity, 57.2s TimeCoverageRelationStatistics Valid=7533, Invalid=59205, Unknown=100, NotChecked=2068, Total=68906 [2022-12-14 07:25:22,032 INFO L413 NwaCegarLoop]: 815 mSDtfsCounter, 9562 mSDsluCounter, 41274 mSDsCounter, 0 mSdLazyCounter, 78151 mSolverCounterSat, 601 mSolverCounterUnsat, 2762 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9624 SdHoareTripleChecker+Valid, 42089 SdHoareTripleChecker+Invalid, 93538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 78151 IncrementalHoareTripleChecker+Invalid, 2762 IncrementalHoareTripleChecker+Unknown, 12024 IncrementalHoareTripleChecker+Unchecked, 123.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:25:22,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9624 Valid, 42089 Invalid, 93538 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [601 Valid, 78151 Invalid, 2762 Unknown, 12024 Unchecked, 123.0s Time] [2022-12-14 07:25:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13079 states. [2022-12-14 07:25:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13079 to 4968. [2022-12-14 07:25:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4968 states, 4181 states have (on average 1.7321215020330065) internal successors, (7242), 4922 states have internal predecessors, (7242), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-12-14 07:25:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 7333 transitions. [2022-12-14 07:25:22,118 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 7333 transitions. Word has length 123 [2022-12-14 07:25:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:25:22,118 INFO L495 AbstractCegarLoop]: Abstraction has 4968 states and 7333 transitions. [2022-12-14 07:25:22,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 109 states have (on average 2.293577981651376) internal successors, (250), 110 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:25:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 7333 transitions. [2022-12-14 07:25:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 07:25:22,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:25:22,119 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:25:22,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-14 07:25:22,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (50)] Forceful destruction successful, exit code 0 [2022-12-14 07:25:22,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2022-12-14 07:25:22,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:25:22,721 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-12-14 07:25:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:25:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1206624119, now seen corresponding path program 1 times [2022-12-14 07:25:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:25:22,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660723718] [2022-12-14 07:25:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:25:22,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:25:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:25:22,726 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:25:22,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/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 (53)] Waiting until timeout for monitored process [2022-12-14 07:25:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:25:23,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-14 07:25:23,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:25:23,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 07:25:23,794 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:25:23,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 07:25:23,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:25:23,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:25:23,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:25:23,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 07:25:23,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:25:23,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8757))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8758)))) is different from true [2022-12-14 07:25:24,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8759)))) is different from true [2022-12-14 07:25:24,011 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8762) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8761)))) is different from true [2022-12-14 07:25:24,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8764))) (exists ((v_ArrVal_8763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8763) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:25:24,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8765) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8766) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:25:24,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8768)))) is different from true [2022-12-14 07:25:24,088 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8771))) (exists ((v_ArrVal_8772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8772)))) is different from true [2022-12-14 07:25:24,098 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8774) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:25:24,133 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8777) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8778)))) is different from true [2022-12-14 07:25:24,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8787) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8788)))) is different from true [2022-12-14 07:25:24,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8794))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8793) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:25:24,348 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8797))) (exists ((v_ArrVal_8798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8798)))) is different from true [2022-12-14 07:25:24,358 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8800))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8799)))) is different from true [2022-12-14 07:25:24,368 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8802))) (exists ((v_ArrVal_8801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8801) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-12-14 07:25:24,516 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8814) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8813)))) is different from true [2022-12-14 07:25:24,526 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8816))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8815) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:25:24,536 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8817))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8818) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:25:24,546 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8820) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8819)))) is different from true [2022-12-14 07:25:24,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8822) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8821)))) is different from true [2022-12-14 07:25:24,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8823))) (exists ((v_ArrVal_8824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8824)))) is different from true [2022-12-14 07:25:24,576 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8826))) (exists ((v_ArrVal_8825 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8825)))) is different from true [2022-12-14 07:25:24,586 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8828) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8827)))) is different from true [2022-12-14 07:25:24,596 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8830))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8829)))) is different from true [2022-12-14 07:25:24,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8831 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8831) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8832) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 07:25:24,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8833))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8834)))) is different from true [2022-12-14 07:25:24,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8836))) (exists ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8835) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:25:24,639 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8838))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8837) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 07:25:24,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8840))) (exists ((v_ArrVal_8839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8839)))) is different from true [2022-12-14 07:25:24,661 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8841))) (exists ((v_ArrVal_8842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8842)))) is different from true [2022-12-14 07:25:24,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8843) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8844)))) is different from true [2022-12-14 07:25:24,711 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:25:24,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:25:24,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:25:24,819 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:25:24,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:25:24,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:25:24,921 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:25:24,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 07:25:24,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:25:24,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 07:25:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 07:25:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2022-12-14 07:25:24,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:25:25,161 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 07:25:25,194 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_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-12-14 07:25:25,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8845) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8846))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8845) .cse2 v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 07:25:27,337 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8940))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8846))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8939) .cse0 v_ArrVal_8845) .cse1 v_ArrVal_8847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8940))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8939) .cse6 v_ArrVal_8845) (select (select (store .cse7 .cse6 v_ArrVal_8846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8847))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-14 07:25:27,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:25:27,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660723718] [2022-12-14 07:25:27,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660723718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:25:27,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2047694456] [2022-12-14 07:25:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:25:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:25:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:25:27,351 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:25:27,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ce9cea-4e2c-4df3-8a6e-845926575b8c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process