./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- 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-4e7fbc6 [2022-11-23 03:20:45,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:20:45,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:20:46,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:20:46,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:20:46,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:20:46,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:20:46,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:20:46,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:20:46,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:20:46,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:20:46,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:20:46,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:20:46,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:20:46,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:20:46,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:20:46,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:20:46,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:20:46,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:20:46,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:20:46,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:20:46,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:20:46,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:20:46,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:20:46,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:20:46,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:20:46,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:20:46,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:20:46,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:20:46,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:20:46,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:20:46,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:20:46,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:20:46,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:20:46,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:20:46,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:20:46,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:20:46,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:20:46,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:20:46,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:20:46,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:20:46,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:20:46,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:20:46,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:20:46,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:20:46,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:20:46,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:20:46,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:20:46,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:20:46,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:20:46,092 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:20:46,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:20:46,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:20:46,093 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:20:46,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:20:46,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:20:46,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:20:46,094 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:20:46,094 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:20:46,094 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:20:46,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:20:46,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:20:46,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:20:46,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:20:46,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:20:46,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:20:46,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:20:46,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:20:46,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:20:46,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:20:46,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:20:46,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:20:46,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:20:46,097 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:20:46,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:20:46,098 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2022-11-23 03:20:46,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:20:46,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:20:46,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:20:46,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:20:46,416 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:20:46,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2022-11-23 03:20:49,414 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:20:49,845 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:20:49,846 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2022-11-23 03:20:49,860 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data/e9d2ab2d3/1481b2217ed547649abe6462e032a1ac/FLAG668271023 [2022-11-23 03:20:49,875 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data/e9d2ab2d3/1481b2217ed547649abe6462e032a1ac [2022-11-23 03:20:49,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:20:49,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:20:49,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:20:49,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:20:49,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:20:49,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:49" (1/1) ... [2022-11-23 03:20:49,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7c0ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:49, skipping insertion in model container [2022-11-23 03:20:49,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:49" (1/1) ... [2022-11-23 03:20:49,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:20:49,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:20:50,357 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[33021,33034] [2022-11-23 03:20:50,517 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[45234,45247] [2022-11-23 03:20:50,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:20:50,550 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-23 03:20:50,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70dff39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:50, skipping insertion in model container [2022-11-23 03:20:50,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:20:50,552 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 03:20:50,554 INFO L158 Benchmark]: Toolchain (without parser) took 674.58ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 94.2MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 03:20:50,555 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:20:50,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.34ms. Allocated memory is still 146.8MB. Free memory was 113.6MB in the beginning and 94.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 03:20:50,557 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.19ms. Allocated memory is still 146.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.34ms. Allocated memory is still 146.8MB. Free memory was 113.6MB in the beginning and 94.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- 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-4e7fbc6 [2022-11-23 03:20:52,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:20:52,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:20:52,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:20:52,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:20:52,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:20:52,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:20:52,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:20:52,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:20:52,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:20:52,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:20:52,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:20:52,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:20:52,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:20:52,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:20:52,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:20:52,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:20:52,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:20:52,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:20:52,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:20:52,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:20:52,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:20:52,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:20:52,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:20:52,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:20:52,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:20:52,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:20:52,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:20:52,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:20:52,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:20:52,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:20:52,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:20:52,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:20:52,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:20:52,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:20:52,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:20:52,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:20:52,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:20:52,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:20:52,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:20:52,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:20:52,856 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 03:20:52,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:20:52,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:20:52,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:20:52,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:20:52,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:20:52,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:20:52,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:20:52,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:20:52,882 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:20:52,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:20:52,882 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:20:52,882 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:20:52,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:20:52,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:20:52,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:20:52,883 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:20:52,883 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:20:52,884 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:20:52,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:20:52,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:20:52,884 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 03:20:52,884 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 03:20:52,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:20:52,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:20:52,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:20:52,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:20:52,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:20:52,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:20:52,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:20:52,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:20:52,886 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 03:20:52,886 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 03:20:52,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:20:52,886 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:20:52,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:20:52,887 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 03:20:52,887 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2022-11-23 03:20:53,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:20:53,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:20:53,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:20:53,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:20:53,257 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:20:53,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2022-11-23 03:20:56,293 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:20:56,599 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:20:56,600 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2022-11-23 03:20:56,616 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data/f3219bb4d/7d986237b86f401b8a31a7b66db1a7bd/FLAG448d7e3a7 [2022-11-23 03:20:56,639 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/data/f3219bb4d/7d986237b86f401b8a31a7b66db1a7bd [2022-11-23 03:20:56,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:20:56,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:20:56,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:20:56,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:20:56,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:20:56,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:56" (1/1) ... [2022-11-23 03:20:56,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a91f06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:56, skipping insertion in model container [2022-11-23 03:20:56,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:56" (1/1) ... [2022-11-23 03:20:56,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:20:56,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:20:57,179 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[33021,33034] [2022-11-23 03:20:57,350 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[45234,45247] [2022-11-23 03:20:57,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:20:57,369 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 03:20:57,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:20:57,396 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[33021,33034] [2022-11-23 03:20:57,492 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[45234,45247] [2022-11-23 03:20:57,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:20:57,501 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:20:57,534 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[33021,33034] [2022-11-23 03:20:57,594 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_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i[45234,45247] [2022-11-23 03:20:57,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:20:57,648 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:20:57,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57 WrapperNode [2022-11-23 03:20:57,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:20:57,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:20:57,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:20:57,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:20:57,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,754 INFO L138 Inliner]: procedures = 180, calls = 297, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1007 [2022-11-23 03:20:57,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:20:57,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:20:57,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:20:57,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:20:57,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:20:57,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:20:57,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:20:57,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:20:57,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (1/1) ... [2022-11-23 03:20:57,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:20:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:20:57,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:20:57,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:20:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 03:20:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 03:20:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 03:20:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 03:20:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-23 03:20:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-23 03:20:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-11-23 03:20:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-11-23 03:20:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:20:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:20:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:20:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:20:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-23 03:20:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:20:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:20:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 03:20:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 03:20:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:20:57,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:20:58,230 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:20:58,232 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:20:58,236 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 03:21:03,264 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:21:03,285 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:21:03,289 INFO L300 CfgBuilder]: Removed 62 assume(true) statements. [2022-11-23 03:21:03,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:21:03 BoogieIcfgContainer [2022-11-23 03:21:03,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:21:03,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:21:03,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:21:03,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:21:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:20:56" (1/3) ... [2022-11-23 03:21:03,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bad763e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:21:03, skipping insertion in model container [2022-11-23 03:21:03,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:57" (2/3) ... [2022-11-23 03:21:03,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bad763e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:21:03, skipping insertion in model container [2022-11-23 03:21:03,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:21:03" (3/3) ... [2022-11-23 03:21:03,304 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2022-11-23 03:21:03,323 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:21:03,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-11-23 03:21:03,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:21:03,414 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=PETRI_NET, 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;@4f40381e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:21:03,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-11-23 03:21:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 1096 states, 539 states have (on average 2.241187384044527) internal successors, (1208), 1087 states have internal predecessors, (1208), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-23 03:21:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 03:21:03,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:03,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 03:21:03,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-11-23 03:21:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:03,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227725159] [2022-11-23 03:21:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:03,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-11-23 03:21:03,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:03,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:03,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 03:21:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:03,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:21:03,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:03,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:03,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:03,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227725159] [2022-11-23 03:21:03,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227725159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:03,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:03,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:21:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196464907] [2022-11-23 03:21:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:03,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:03,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:03,793 INFO L87 Difference]: Start difference. First operand has 1096 states, 539 states have (on average 2.241187384044527) internal successors, (1208), 1087 states have internal predecessors, (1208), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:06,091 INFO L93 Difference]: Finished difference Result 1099 states and 1184 transitions. [2022-11-23 03:21:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:06,094 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-11-23 03:21:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:06,111 INFO L225 Difference]: With dead ends: 1099 [2022-11-23 03:21:06,112 INFO L226 Difference]: Without dead ends: 1097 [2022-11-23 03:21:06,113 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-11-23 03:21:06,117 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 969 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:06,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 823 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-23 03:21:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-11-23 03:21:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1085. [2022-11-23 03:21:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 542 states have (on average 2.0904059040590406) internal successors, (1133), 1075 states have internal predecessors, (1133), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 03:21:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1175 transitions. [2022-11-23 03:21:06,203 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1175 transitions. Word has length 3 [2022-11-23 03:21:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:06,204 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1175 transitions. [2022-11-23 03:21:06,204 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-11-23 03:21:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1175 transitions. [2022-11-23 03:21:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 03:21:06,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:06,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 03:21:06,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:06,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:06,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-11-23 03:21:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:06,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748207569] [2022-11-23 03:21:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:06,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:06,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:06,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:06,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 03:21:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:06,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:21:06,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:06,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:21:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:06,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:06,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:06,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748207569] [2022-11-23 03:21:06,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748207569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:06,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:06,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:21:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659881136] [2022-11-23 03:21:06,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:06,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:06,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:06,610 INFO L87 Difference]: Start difference. First operand 1085 states and 1175 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:10,162 INFO L93 Difference]: Finished difference Result 1478 states and 1598 transitions. [2022-11-23 03:21:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:10,163 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-11-23 03:21:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:10,169 INFO L225 Difference]: With dead ends: 1478 [2022-11-23 03:21:10,169 INFO L226 Difference]: Without dead ends: 1478 [2022-11-23 03:21:10,169 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-11-23 03:21:10,170 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 421 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:10,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1608 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-23 03:21:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-11-23 03:21:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1289. [2022-11-23 03:21:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 746 states have (on average 2.0804289544235925) internal successors, (1552), 1278 states have internal predecessors, (1552), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 03:21:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1596 transitions. [2022-11-23 03:21:10,224 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1596 transitions. Word has length 3 [2022-11-23 03:21:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:10,224 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1596 transitions. [2022-11-23 03:21:10,224 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-11-23 03:21:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1596 transitions. [2022-11-23 03:21:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 03:21:10,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:10,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:10,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:10,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:10,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-11-23 03:21:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:10,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382061232] [2022-11-23 03:21:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:10,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:10,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:10,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 03:21:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:10,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:21:10,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:10,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:10,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:21:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:21:10,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:21:10,729 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:21:10,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 03:21:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:10,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:10,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:10,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382061232] [2022-11-23 03:21:10,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382061232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:10,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:10,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346278199] [2022-11-23 03:21:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:10,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:10,767 INFO L87 Difference]: Start difference. First operand 1289 states and 1596 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:13,945 INFO L93 Difference]: Finished difference Result 1294 states and 1599 transitions. [2022-11-23 03:21:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:13,946 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-11-23 03:21:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:13,950 INFO L225 Difference]: With dead ends: 1294 [2022-11-23 03:21:13,950 INFO L226 Difference]: Without dead ends: 1294 [2022-11-23 03:21:13,951 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-11-23 03:21:13,952 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 2025 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:13,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2031 Valid, 517 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 03:21:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-11-23 03:21:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1074. [2022-11-23 03:21:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 542 states have (on average 2.0682656826568264) internal successors, (1121), 1064 states have internal predecessors, (1121), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 03:21:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1163 transitions. [2022-11-23 03:21:14,017 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1163 transitions. Word has length 7 [2022-11-23 03:21:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:14,017 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1163 transitions. [2022-11-23 03:21:14,017 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-11-23 03:21:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1163 transitions. [2022-11-23 03:21:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 03:21:14,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:14,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:14,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:14,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:14,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-11-23 03:21:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:14,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229102783] [2022-11-23 03:21:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:14,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:14,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 03:21:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:14,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:21:14,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:14,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:14,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:14,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229102783] [2022-11-23 03:21:14,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229102783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:14,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:14,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:21:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680954559] [2022-11-23 03:21:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:14,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:14,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:14,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:14,405 INFO L87 Difference]: Start difference. First operand 1074 states and 1163 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:16,867 INFO L93 Difference]: Finished difference Result 1401 states and 1517 transitions. [2022-11-23 03:21:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:16,868 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-11-23 03:21:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:16,872 INFO L225 Difference]: With dead ends: 1401 [2022-11-23 03:21:16,873 INFO L226 Difference]: Without dead ends: 1401 [2022-11-23 03:21:16,873 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-11-23 03:21:16,874 INFO L413 NwaCegarLoop]: 991 mSDtfsCounter, 986 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:16,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1296 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 03:21:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2022-11-23 03:21:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1027. [2022-11-23 03:21:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 542 states have (on average 1.9797047970479704) internal successors, (1073), 1017 states have internal predecessors, (1073), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 03:21:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1115 transitions. [2022-11-23 03:21:16,897 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1115 transitions. Word has length 8 [2022-11-23 03:21:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:16,898 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1115 transitions. [2022-11-23 03:21:16,898 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-11-23 03:21:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1115 transitions. [2022-11-23 03:21:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 03:21:16,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:16,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:16,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -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-11-23 03:21:17,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:17,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-11-23 03:21:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:17,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008284285] [2022-11-23 03:21:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:17,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:17,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 03:21:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:17,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:21:17,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:17,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:21:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:17,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:17,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008284285] [2022-11-23 03:21:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008284285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:17,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:17,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:21:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916089262] [2022-11-23 03:21:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:17,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:17,297 INFO L87 Difference]: Start difference. First operand 1027 states and 1115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:20,655 INFO L93 Difference]: Finished difference Result 1496 states and 1617 transitions. [2022-11-23 03:21:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:20,657 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-11-23 03:21:20,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:20,661 INFO L225 Difference]: With dead ends: 1496 [2022-11-23 03:21:20,662 INFO L226 Difference]: Without dead ends: 1496 [2022-11-23 03:21:20,662 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-11-23 03:21:20,663 INFO L413 NwaCegarLoop]: 1210 mSDtfsCounter, 686 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:20,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1694 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-23 03:21:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-11-23 03:21:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1269. [2022-11-23 03:21:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 792 states have (on average 1.9785353535353536) internal successors, (1567), 1257 states have internal predecessors, (1567), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1613 transitions. [2022-11-23 03:21:20,700 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1613 transitions. Word has length 8 [2022-11-23 03:21:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:20,700 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1613 transitions. [2022-11-23 03:21:20,701 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-11-23 03:21:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1613 transitions. [2022-11-23 03:21:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 03:21:20,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:20,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:20,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:20,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:20,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -657954014, now seen corresponding path program 1 times [2022-11-23 03:21:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:20,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270398940] [2022-11-23 03:21:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:20,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:20,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:20,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:20,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 03:21:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:21,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:21:21,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:21,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:21:21,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:21:21,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:21:21,123 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-11-23 03:21:21,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:21:21,180 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-11-23 03:21:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:21,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:21,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270398940] [2022-11-23 03:21:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270398940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:21,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:21,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773259697] [2022-11-23 03:21:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:21,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:21,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:21,198 INFO L87 Difference]: Start difference. First operand 1269 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:22,884 INFO L93 Difference]: Finished difference Result 1783 states and 2337 transitions. [2022-11-23 03:21:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:22,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 03:21:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:22,902 INFO L225 Difference]: With dead ends: 1783 [2022-11-23 03:21:22,902 INFO L226 Difference]: Without dead ends: 1783 [2022-11-23 03:21:22,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:22,904 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 357 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:22,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 3030 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 03:21:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-11-23 03:21:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1271. [2022-11-23 03:21:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 794 states have (on average 1.9760705289672544) internal successors, (1569), 1259 states have internal predecessors, (1569), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1615 transitions. [2022-11-23 03:21:22,932 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1615 transitions. Word has length 10 [2022-11-23 03:21:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:22,932 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1615 transitions. [2022-11-23 03:21:22,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1615 transitions. [2022-11-23 03:21:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 03:21:22,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:22,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:22,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:23,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-11-23 03:21:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:23,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238045428] [2022-11-23 03:21:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:23,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:23,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:23,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:23,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 03:21:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:23,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:21:23,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:23,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:23,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:23,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238045428] [2022-11-23 03:21:23,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238045428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:23,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:23,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:23,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749102159] [2022-11-23 03:21:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:23,374 INFO L87 Difference]: Start difference. First operand 1271 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:23,408 INFO L93 Difference]: Finished difference Result 1240 states and 1583 transitions. [2022-11-23 03:21:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 03:21:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:23,413 INFO L225 Difference]: With dead ends: 1240 [2022-11-23 03:21:23,413 INFO L226 Difference]: Without dead ends: 1240 [2022-11-23 03:21:23,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:23,415 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 962 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:23,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1142 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:21:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-11-23 03:21:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1229. [2022-11-23 03:21:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 776 states have (on average 1.9664948453608246) internal successors, (1526), 1217 states have internal predecessors, (1526), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1572 transitions. [2022-11-23 03:21:23,441 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1572 transitions. Word has length 18 [2022-11-23 03:21:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:23,441 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1572 transitions. [2022-11-23 03:21:23,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1572 transitions. [2022-11-23 03:21:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 03:21:23,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:23,443 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-11-23 03:21:23,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:23,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:23,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-11-23 03:21:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528279032] [2022-11-23 03:21:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:23,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:23,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 03:21:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:23,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:21:23,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:23,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:23,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528279032] [2022-11-23 03:21:23,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528279032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:23,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460372429] [2022-11-23 03:21:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:23,867 INFO L87 Difference]: Start difference. First operand 1229 states and 1572 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:23,956 INFO L93 Difference]: Finished difference Result 1219 states and 1555 transitions. [2022-11-23 03:21:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 03:21:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:23,961 INFO L225 Difference]: With dead ends: 1219 [2022-11-23 03:21:23,961 INFO L226 Difference]: Without dead ends: 1219 [2022-11-23 03:21:23,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:23,962 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 943 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:23,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 2095 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:21:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-11-23 03:21:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1207. [2022-11-23 03:21:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 768 states have (on average 1.94921875) internal successors, (1497), 1195 states have internal predecessors, (1497), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1543 transitions. [2022-11-23 03:21:23,984 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1543 transitions. Word has length 20 [2022-11-23 03:21:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:23,984 INFO L495 AbstractCegarLoop]: Abstraction has 1207 states and 1543 transitions. [2022-11-23 03:21:23,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1543 transitions. [2022-11-23 03:21:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 03:21:23,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:23,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:24,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:24,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:24,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-11-23 03:21:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100715402] [2022-11-23 03:21:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:24,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:24,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 03:21:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:24,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:21:24,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:24,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:24,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:24,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:24,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100715402] [2022-11-23 03:21:24,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100715402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:24,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:24,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453296293] [2022-11-23 03:21:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:24,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:24,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:24,515 INFO L87 Difference]: Start difference. First operand 1207 states and 1543 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:26,992 INFO L93 Difference]: Finished difference Result 1795 states and 2365 transitions. [2022-11-23 03:21:26,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:26,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-23 03:21:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:26,999 INFO L225 Difference]: With dead ends: 1795 [2022-11-23 03:21:26,999 INFO L226 Difference]: Without dead ends: 1795 [2022-11-23 03:21:26,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:27,000 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 2098 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:27,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 993 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 03:21:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-11-23 03:21:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1203. [2022-11-23 03:21:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 768 states have (on average 1.9440104166666667) internal successors, (1493), 1191 states have internal predecessors, (1493), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1539 transitions. [2022-11-23 03:21:27,027 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1539 transitions. Word has length 34 [2022-11-23 03:21:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:27,028 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1539 transitions. [2022-11-23 03:21:27,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1539 transitions. [2022-11-23 03:21:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 03:21:27,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:27,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:27,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:27,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:27,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-11-23 03:21:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:27,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866383998] [2022-11-23 03:21:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:27,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:27,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:27,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:27,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 03:21:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:27,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:21:27,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:27,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:21:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:27,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:27,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866383998] [2022-11-23 03:21:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866383998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:27,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:27,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890384766] [2022-11-23 03:21:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:27,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:27,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:27,670 INFO L87 Difference]: Start difference. First operand 1203 states and 1539 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:31,693 INFO L93 Difference]: Finished difference Result 1437 states and 1550 transitions. [2022-11-23 03:21:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:31,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-23 03:21:31,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:31,697 INFO L225 Difference]: With dead ends: 1437 [2022-11-23 03:21:31,697 INFO L226 Difference]: Without dead ends: 1437 [2022-11-23 03:21:31,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:31,698 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 1176 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:31,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1723 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-23 03:21:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-11-23 03:21:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1199. [2022-11-23 03:21:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 768 states have (on average 1.9388020833333333) internal successors, (1489), 1187 states have internal predecessors, (1489), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1535 transitions. [2022-11-23 03:21:31,722 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1535 transitions. Word has length 34 [2022-11-23 03:21:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:31,722 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1535 transitions. [2022-11-23 03:21:31,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1535 transitions. [2022-11-23 03:21:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 03:21:31,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:31,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:31,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:31,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:31,936 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:31,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1045534242, now seen corresponding path program 1 times [2022-11-23 03:21:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:31,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36361589] [2022-11-23 03:21:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:31,939 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:31,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 03:21:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:32,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:21:32,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:32,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:32,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:32,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36361589] [2022-11-23 03:21:32,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36361589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:32,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:32,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:32,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245799955] [2022-11-23 03:21:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:32,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:32,225 INFO L87 Difference]: Start difference. First operand 1199 states and 1535 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:32,291 INFO L93 Difference]: Finished difference Result 1204 states and 1536 transitions. [2022-11-23 03:21:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-23 03:21:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:32,296 INFO L225 Difference]: With dead ends: 1204 [2022-11-23 03:21:32,296 INFO L226 Difference]: Without dead ends: 1204 [2022-11-23 03:21:32,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:32,297 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 912 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:32,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2073 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:21:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-11-23 03:21:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1193. [2022-11-23 03:21:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 762 states have (on average 1.9409448818897639) internal successors, (1479), 1181 states have internal predecessors, (1479), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:21:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1525 transitions. [2022-11-23 03:21:32,318 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1525 transitions. Word has length 49 [2022-11-23 03:21:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:32,319 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1525 transitions. [2022-11-23 03:21:32,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1525 transitions. [2022-11-23 03:21:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-23 03:21:32,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:32,320 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-11-23 03:21:32,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-23 03:21:32,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:32,540 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -551406574, now seen corresponding path program 1 times [2022-11-23 03:21:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:32,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981900521] [2022-11-23 03:21:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:32,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:32,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:32,542 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:32,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 03:21:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:32,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:21:32,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:33,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:33,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:33,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981900521] [2022-11-23 03:21:33,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981900521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:33,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:33,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:33,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121736060] [2022-11-23 03:21:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:33,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:33,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:33,124 INFO L87 Difference]: Start difference. First operand 1193 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:33,412 INFO L93 Difference]: Finished difference Result 1735 states and 2262 transitions. [2022-11-23 03:21:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-23 03:21:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:33,417 INFO L225 Difference]: With dead ends: 1735 [2022-11-23 03:21:33,417 INFO L226 Difference]: Without dead ends: 1735 [2022-11-23 03:21:33,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:33,418 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 407 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:33,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2069 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:21:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-11-23 03:21:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1556. [2022-11-23 03:21:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1123 states have (on average 1.9225289403383794) internal successors, (2159), 1542 states have internal predecessors, (2159), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:21:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2209 transitions. [2022-11-23 03:21:33,450 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2209 transitions. Word has length 57 [2022-11-23 03:21:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:33,451 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 2209 transitions. [2022-11-23 03:21:33,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2209 transitions. [2022-11-23 03:21:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 03:21:33,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:33,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:33,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:33,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:33,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-11-23 03:21:33,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:33,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812806456] [2022-11-23 03:21:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:33,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:33,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:33,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:33,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 03:21:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:34,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:21:34,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:34,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:21:34,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:34,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:21:34,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:21:34,632 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:21:34,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 03:21:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:34,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:34,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:34,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812806456] [2022-11-23 03:21:34,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812806456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:34,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:34,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066714270] [2022-11-23 03:21:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:34,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:34,650 INFO L87 Difference]: Start difference. First operand 1556 states and 2209 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:37,007 INFO L93 Difference]: Finished difference Result 1527 states and 2181 transitions. [2022-11-23 03:21:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-23 03:21:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:37,013 INFO L225 Difference]: With dead ends: 1527 [2022-11-23 03:21:37,013 INFO L226 Difference]: Without dead ends: 1527 [2022-11-23 03:21:37,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:37,014 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 1673 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:37,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 454 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 03:21:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-11-23 03:21:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1108. [2022-11-23 03:21:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 718 states have (on average 1.809192200557103) internal successors, (1299), 1097 states have internal predecessors, (1299), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 03:21:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1343 transitions. [2022-11-23 03:21:37,037 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1343 transitions. Word has length 60 [2022-11-23 03:21:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:37,038 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1343 transitions. [2022-11-23 03:21:37,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1343 transitions. [2022-11-23 03:21:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 03:21:37,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:37,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:37,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:37,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:37,254 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-11-23 03:21:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:37,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784363430] [2022-11-23 03:21:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:37,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:37,256 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:37,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 03:21:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:37,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:21:37,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:37,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:37,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:21:37,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 03:21:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:37,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:37,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:37,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784363430] [2022-11-23 03:21:37,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784363430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:37,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:37,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018552423] [2022-11-23 03:21:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:37,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:21:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:37,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:21:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:37,605 INFO L87 Difference]: Start difference. First operand 1108 states and 1343 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:40,560 INFO L93 Difference]: Finished difference Result 1107 states and 1342 transitions. [2022-11-23 03:21:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:21:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-23 03:21:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:40,563 INFO L225 Difference]: With dead ends: 1107 [2022-11-23 03:21:40,563 INFO L226 Difference]: Without dead ends: 1107 [2022-11-23 03:21:40,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:21:40,563 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 4 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:40,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2524 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 03:21:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-11-23 03:21:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2022-11-23 03:21:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 718 states have (on average 1.807799442896936) internal successors, (1298), 1096 states have internal predecessors, (1298), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 03:21:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1342 transitions. [2022-11-23 03:21:40,583 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1342 transitions. Word has length 65 [2022-11-23 03:21:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:40,583 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1342 transitions. [2022-11-23 03:21:40,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1342 transitions. [2022-11-23 03:21:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 03:21:40,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:40,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] [2022-11-23 03:21:40,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:40,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:40,800 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-11-23 03:21:40,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643765412] [2022-11-23 03:21:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:40,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:40,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:40,803 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:40,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-23 03:21:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:41,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 03:21:41,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:41,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:21:41,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:21:41,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:21:41,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-23 03:21:41,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:21:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:41,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:41,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:41,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643765412] [2022-11-23 03:21:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643765412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:41,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:41,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69174844] [2022-11-23 03:21:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:21:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:21:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:41,275 INFO L87 Difference]: Start difference. First operand 1107 states and 1342 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:45,083 INFO L93 Difference]: Finished difference Result 1106 states and 1341 transitions. [2022-11-23 03:21:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:21:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-23 03:21:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:45,088 INFO L225 Difference]: With dead ends: 1106 [2022-11-23 03:21:45,088 INFO L226 Difference]: Without dead ends: 1106 [2022-11-23 03:21:45,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:21:45,089 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:45,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2569 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-23 03:21:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-11-23 03:21:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2022-11-23 03:21:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 717 states have (on average 1.808926080892608) internal successors, (1297), 1095 states have internal predecessors, (1297), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 03:21:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1341 transitions. [2022-11-23 03:21:45,108 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1341 transitions. Word has length 65 [2022-11-23 03:21:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:45,109 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1341 transitions. [2022-11-23 03:21:45,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1341 transitions. [2022-11-23 03:21:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 03:21:45,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:45,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:45,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -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)] Ended with exit code 0 [2022-11-23 03:21:45,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:45,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -599006260, now seen corresponding path program 1 times [2022-11-23 03:21:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:45,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336575586] [2022-11-23 03:21:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:45,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:45,327 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:45,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-23 03:21:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:45,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:21:45,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:45,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:45,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:45,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336575586] [2022-11-23 03:21:45,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336575586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:45,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:45,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267462343] [2022-11-23 03:21:45,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:45,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:45,692 INFO L87 Difference]: Start difference. First operand 1106 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:21:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:45,744 INFO L93 Difference]: Finished difference Result 1109 states and 1345 transitions. [2022-11-23 03:21:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-11-23 03:21:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:45,750 INFO L225 Difference]: With dead ends: 1109 [2022-11-23 03:21:45,750 INFO L226 Difference]: Without dead ends: 1109 [2022-11-23 03:21:45,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:45,751 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:45,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2866 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:21:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-23 03:21:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-11-23 03:21:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 719 states have (on average 1.8080667593880388) internal successors, (1300), 1098 states have internal predecessors, (1300), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:21:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1345 transitions. [2022-11-23 03:21:45,772 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1345 transitions. Word has length 73 [2022-11-23 03:21:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:45,772 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1345 transitions. [2022-11-23 03:21:45,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:21:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1345 transitions. [2022-11-23 03:21:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-23 03:21:45,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:45,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:45,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:45,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:45,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash -481982235, now seen corresponding path program 1 times [2022-11-23 03:21:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:45,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38615486] [2022-11-23 03:21:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:45,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-11-23 03:21:45,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:45,990 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:45,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 03:21:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:46,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:21:46,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:46,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:46,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:46,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38615486] [2022-11-23 03:21:46,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38615486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:21:46,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:21:46,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-23 03:21:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569460442] [2022-11-23 03:21:46,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:21:46,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:21:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:21:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:21:46,470 INFO L87 Difference]: Start difference. First operand 1109 states and 1345 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:21:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:46,695 INFO L93 Difference]: Finished difference Result 1121 states and 1362 transitions. [2022-11-23 03:21:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:21:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-23 03:21:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:46,700 INFO L225 Difference]: With dead ends: 1121 [2022-11-23 03:21:46,700 INFO L226 Difference]: Without dead ends: 1121 [2022-11-23 03:21:46,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-23 03:21:46,701 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 25 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:46,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2870 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:21:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2022-11-23 03:21:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1119. [2022-11-23 03:21:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 728 states have (on average 1.8063186813186813) internal successors, (1315), 1107 states have internal predecessors, (1315), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:21:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1360 transitions. [2022-11-23 03:21:46,721 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1360 transitions. Word has length 74 [2022-11-23 03:21:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:46,722 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1360 transitions. [2022-11-23 03:21:46,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:21:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1360 transitions. [2022-11-23 03:21:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-23 03:21:46,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:46,723 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:46,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:46,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:46,939 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1608982004, now seen corresponding path program 2 times [2022-11-23 03:21:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:46,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347082378] [2022-11-23 03:21:46,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:21:46,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:46,940 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:46,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-23 03:21:47,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:21:47,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:47,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:21:47,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:47,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:47,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:47,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347082378] [2022-11-23 03:21:47,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347082378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:21:47,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:21:47,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-23 03:21:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942543783] [2022-11-23 03:21:47,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:21:47,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:21:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:21:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:21:47,798 INFO L87 Difference]: Start difference. First operand 1119 states and 1360 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:21:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:48,625 INFO L93 Difference]: Finished difference Result 1140 states and 1388 transitions. [2022-11-23 03:21:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 03:21:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 77 [2022-11-23 03:21:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:48,630 INFO L225 Difference]: With dead ends: 1140 [2022-11-23 03:21:48,631 INFO L226 Difference]: Without dead ends: 1136 [2022-11-23 03:21:48,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-23 03:21:48,632 INFO L413 NwaCegarLoop]: 961 mSDtfsCounter, 55 mSDsluCounter, 6691 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 7652 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:48,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 7652 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:21:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-11-23 03:21:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1128. [2022-11-23 03:21:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 737 states have (on average 1.8005427408412482) internal successors, (1327), 1116 states have internal predecessors, (1327), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:21:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1372 transitions. [2022-11-23 03:21:48,652 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1372 transitions. Word has length 77 [2022-11-23 03:21:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:48,652 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1372 transitions. [2022-11-23 03:21:48,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:21:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1372 transitions. [2022-11-23 03:21:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-23 03:21:48,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:48,654 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:48,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-23 03:21:48,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:48,870 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 590103404, now seen corresponding path program 3 times [2022-11-23 03:21:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:48,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961890543] [2022-11-23 03:21:48,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:21:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:48,872 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:48,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-23 03:21:49,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 03:21:49,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:49,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 03:21:49,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:49,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:50,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961890543] [2022-11-23 03:21:50,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961890543] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:21:50,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:21:50,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-23 03:21:50,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047369855] [2022-11-23 03:21:50,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:21:50,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 03:21:50,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:50,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 03:21:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-23 03:21:50,791 INFO L87 Difference]: Start difference. First operand 1128 states and 1372 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:21:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:54,956 INFO L93 Difference]: Finished difference Result 1170 states and 1434 transitions. [2022-11-23 03:21:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 03:21:54,957 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 83 [2022-11-23 03:21:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:54,961 INFO L225 Difference]: With dead ends: 1170 [2022-11-23 03:21:54,961 INFO L226 Difference]: Without dead ends: 1164 [2022-11-23 03:21:54,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 03:21:54,962 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 153 mSDsluCounter, 14385 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 15351 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:54,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 15351 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 03:21:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2022-11-23 03:21:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1146. [2022-11-23 03:21:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 755 states have (on average 1.7880794701986755) internal successors, (1350), 1134 states have internal predecessors, (1350), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:21:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1395 transitions. [2022-11-23 03:21:54,982 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1395 transitions. Word has length 83 [2022-11-23 03:21:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:54,983 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1395 transitions. [2022-11-23 03:21:54,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:21:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1395 transitions. [2022-11-23 03:21:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-23 03:21:54,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:54,984 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:54,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:55,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:55,191 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:21:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1945464364, now seen corresponding path program 4 times [2022-11-23 03:21:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195759834] [2022-11-23 03:21:55,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:21:55,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:55,194 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:21:55,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -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-11-23 03:21:55,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:21:55,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:55,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 03:21:55,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:56,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:58,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:58,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195759834] [2022-11-23 03:21:58,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195759834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:21:58,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:21:58,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-23 03:21:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016829143] [2022-11-23 03:21:58,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:21:58,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 03:21:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 03:21:58,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 03:21:58,562 INFO L87 Difference]: Start difference. First operand 1146 states and 1395 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:22:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:22:11,122 INFO L93 Difference]: Finished difference Result 1226 states and 1507 transitions. [2022-11-23 03:22:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-23 03:22:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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 95 [2022-11-23 03:22:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:22:11,130 INFO L225 Difference]: With dead ends: 1226 [2022-11-23 03:22:11,130 INFO L226 Difference]: Without dead ends: 1222 [2022-11-23 03:22:11,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-23 03:22:11,134 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 429 mSDsluCounter, 22406 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 23384 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:22:11,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 23384 Invalid, 2793 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [376 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-23 03:22:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-11-23 03:22:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1180. [2022-11-23 03:22:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 789 states have (on average 1.7693282636248415) internal successors, (1396), 1168 states have internal predecessors, (1396), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:22:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1441 transitions. [2022-11-23 03:22:11,164 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1441 transitions. Word has length 95 [2022-11-23 03:22:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:22:11,165 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1441 transitions. [2022-11-23 03:22:11,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:22:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1441 transitions. [2022-11-23 03:22:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-23 03:22:11,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:22:11,169 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] [2022-11-23 03:22:11,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-23 03:22:11,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:22:11,386 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:22:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:22:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2045448052, now seen corresponding path program 5 times [2022-11-23 03:22:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:22:11,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657453038] [2022-11-23 03:22:11,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:22:11,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:22:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:22:11,388 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:22:11,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-23 03:22:13,106 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-23 03:22:13,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:22:13,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 03:22:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:22:13,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:22:13,303 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:22:13,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:22:13,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:22:13,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 03:22:13,572 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:22:14,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940)))) is different from true [2022-11-23 03:22:14,841 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945)))) is different from true [2022-11-23 03:22:15,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:22:15,405 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:22:15,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 03:22:15,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 03:22:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-23 03:22:15,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:22:15,875 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 03:22:15,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:22:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657453038] [2022-11-23 03:22:15,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657453038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:22:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [613470967] [2022-11-23 03:22:15,878 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:22:15,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:22:15,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:22:15,879 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:22:15,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-23 03:23:28,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-23 03:23:28,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:23:28,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 03:23:28,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:23:28,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:23:28,845 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:23:28,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:23:28,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:23:28,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 03:23:29,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:29,073 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380)))) is different from true [2022-11-23 03:23:29,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-11-23 03:23:29,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396)))) is different from true [2022-11-23 03:23:29,730 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:29,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409)))) is different from true [2022-11-23 03:23:30,136 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2022-11-23 03:23:30,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413)))) is different from true [2022-11-23 03:23:30,227 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415)))) is different from true [2022-11-23 03:23:30,406 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,500 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:23:30,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 03:23:30,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 03:23:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 462 not checked. [2022-11-23 03:23:30,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:23:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [613470967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:23:32,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:23:32,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 24 [2022-11-23 03:23:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377370152] [2022-11-23 03:23:32,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:23:32,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 03:23:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:23:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 03:23:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=110, Unknown=27, NotChecked=612, Total=812 [2022-11-23 03:23:32,942 INFO L87 Difference]: Start difference. First operand 1180 states and 1441 transitions. Second operand has 25 states, 23 states have (on average 4.434782608695652) internal successors, (102), 25 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:23:34,183 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:34,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2022-11-23 03:23:34,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2022-11-23 03:23:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:23:45,515 INFO L93 Difference]: Finished difference Result 1190 states and 1449 transitions. [2022-11-23 03:23:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 03:23:45,516 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.434782608695652) internal successors, (102), 25 states have internal predecessors, (102), 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 117 [2022-11-23 03:23:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:23:45,519 INFO L225 Difference]: With dead ends: 1190 [2022-11-23 03:23:45,520 INFO L226 Difference]: Without dead ends: 1186 [2022-11-23 03:23:45,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 75 SemanticMatches, 33 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=88, Invalid=169, Unknown=33, NotChecked=900, Total=1190 [2022-11-23 03:23:45,521 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 798 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 8 mSolverCounterUnsat, 772 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 19344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 772 IncrementalHoareTripleChecker+Unknown, 15601 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:23:45,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3160 Invalid, 19344 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 2963 Invalid, 772 Unknown, 15601 Unchecked, 12.3s Time] [2022-11-23 03:23:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-11-23 03:23:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1179. [2022-11-23 03:23:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 789 states have (on average 1.7629911280101394) internal successors, (1391), 1167 states have internal predecessors, (1391), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:23:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1436 transitions. [2022-11-23 03:23:45,540 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1436 transitions. Word has length 117 [2022-11-23 03:23:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:23:45,540 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1436 transitions. [2022-11-23 03:23:45,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.434782608695652) internal successors, (102), 25 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:23:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1436 transitions. [2022-11-23 03:23:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-23 03:23:45,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:23:45,542 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] [2022-11-23 03:23:45,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-23 03:23:45,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-23 03:23:45,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:23:45,955 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:23:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2045448051, now seen corresponding path program 1 times [2022-11-23 03:23:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:23:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395986736] [2022-11-23 03:23:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:23:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:23:45,957 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:23:45,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-23 03:23:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:46,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-23 03:23:46,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:23:46,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:23:46,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:23:46,985 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:23:46,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-11-23 03:23:47,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:23:47,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:23:47,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 03:23:47,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 03:23:47,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:47,384 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850)))) is different from true [2022-11-23 03:23:47,434 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854)))) is different from true [2022-11-23 03:23:47,449 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:47,462 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858)))) is different from true [2022-11-23 03:23:47,511 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:47,527 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863)))) is different from true [2022-11-23 03:23:47,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:47,592 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:47,606 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-23 03:23:47,709 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877)))) is different from true [2022-11-23 03:23:47,725 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:47,780 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883)))) is different from true [2022-11-23 03:23:47,836 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887)))) is different from true [2022-11-23 03:23:47,893 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891)))) is different from true [2022-11-23 03:23:48,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:48,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:48,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-11-23 03:23:48,312 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-23 03:23:48,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920)))) is different from true [2022-11-23 03:23:48,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2922))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921)))) is different from true [2022-11-23 03:23:48,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926)))) is different from true [2022-11-23 03:23:48,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2927))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2928)))) is different from true [2022-11-23 03:23:48,514 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:23:48,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 03:23:48,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 03:23:48,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 03:23:48,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:23:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2022-11-23 03:23:48,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:23:49,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-23 03:23:49,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:23:49,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395986736] [2022-11-23 03:23:49,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395986736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:23:49,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2051246865] [2022-11-23 03:23:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:23:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:23:49,825 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:23:49,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-23 03:25:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:25:40,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 03:25:40,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:25:40,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:25:41,003 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:25:41,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 03:25:41,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:25:41,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:25:41,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:25:41,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 03:25:41,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 03:25:41,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3407) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:25:41,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:41,506 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:41,525 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3414)))) is different from true [2022-11-23 03:25:41,544 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:41,608 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420)))) is different from true [2022-11-23 03:25:41,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:41,804 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:42,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440)))) is different from true [2022-11-23 03:25:42,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3444))) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-23 03:25:42,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3447))) (exists ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3446) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:25:42,156 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451)))) is different from true [2022-11-23 03:25:42,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:42,192 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454)))) is different from true [2022-11-23 03:25:42,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3456)))) is different from true [2022-11-23 03:25:42,326 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462)))) is different from true [2022-11-23 03:25:42,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465)))) is different from true [2022-11-23 03:25:42,361 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:42,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3471)))) is different from true [2022-11-23 03:25:42,613 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3480))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:42,630 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:42,744 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:25:42,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 03:25:42,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 03:25:42,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 03:25:42,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:25:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 714 not checked. [2022-11-23 03:25:42,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:25:43,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-23 03:25:43,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2051246865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:25:43,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:25:43,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 52 [2022-11-23 03:25:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434818560] [2022-11-23 03:25:43,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:25:43,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-23 03:25:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:25:43,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-23 03:25:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=125, Unknown=54, NotChecked=2898, Total=3192 [2022-11-23 03:25:43,831 INFO L87 Difference]: Start difference. First operand 1179 states and 1436 transitions. Second operand has 53 states, 51 states have (on average 2.7450980392156863) internal successors, (140), 53 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:25:45,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_ArrVal_3444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3444))) (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3480))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3471))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_3407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3407) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:25:45,097 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_ArrVal_3444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3444))) (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3480))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2927))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3447))) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3446) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3471))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3414))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2928))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_3407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3407) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-11-23 03:25:45,115 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_ArrVal_3444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3444))) (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3480))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2927))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_2922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2922))) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3447))) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3446) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3471))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3414))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2928))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_3407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3407) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-11-23 03:25:45,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_ArrVal_3444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3444))) (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3480))) (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2927))) (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3417))) (exists ((v_ArrVal_2922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2922))) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3447))) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_3456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3456))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3467) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3446) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420))) (exists ((v_ArrVal_3471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3471))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465))) (exists ((v_ArrVal_3416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3416) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3466) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3414))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926))) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2928))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891))) (exists ((v_ArrVal_3407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3407) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-11-23 03:25:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:25:56,435 INFO L93 Difference]: Finished difference Result 1185 states and 1442 transitions. [2022-11-23 03:25:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:25:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.7450980392156863) internal successors, (140), 53 states have internal predecessors, (140), 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 117 [2022-11-23 03:25:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:25:56,439 INFO L225 Difference]: With dead ends: 1185 [2022-11-23 03:25:56,439 INFO L226 Difference]: Without dead ends: 1185 [2022-11-23 03:25:56,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 139 SyntacticMatches, 46 SemanticMatches, 65 ConstructedPredicates, 50 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=161, Invalid=247, Unknown=64, NotChecked=3950, Total=4422 [2022-11-23 03:25:56,441 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 797 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 9 mSolverCounterUnsat, 586 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 46627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 586 IncrementalHoareTripleChecker+Unknown, 42710 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:25:56,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2002 Invalid, 46627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 3322 Invalid, 586 Unknown, 42710 Unchecked, 12.0s Time] [2022-11-23 03:25:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-11-23 03:25:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1178. [2022-11-23 03:25:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 789 states have (on average 1.761723700887199) internal successors, (1390), 1166 states have internal predecessors, (1390), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:25:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1435 transitions. [2022-11-23 03:25:56,460 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1435 transitions. Word has length 117 [2022-11-23 03:25:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:25:56,461 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1435 transitions. [2022-11-23 03:25:56,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.7450980392156863) internal successors, (140), 53 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:25:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1435 transitions. [2022-11-23 03:25:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-23 03:25:56,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:25:56,463 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:25:56,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -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-11-23 03:25:56,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-23 03:25:56,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt [2022-11-23 03:25:56,880 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:25:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:25:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1053460856, now seen corresponding path program 1 times [2022-11-23 03:25:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:25:56,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191396171] [2022-11-23 03:25:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:25:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:25:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:25:56,883 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:25:56,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-23 03:25:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:25:57,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 03:25:57,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:25:57,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:25:58,171 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:25:58,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:25:58,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:25:58,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 03:25:59,384 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:00,021 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3989) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:00,323 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3996)))) is different from true [2022-11-23 03:26:00,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:26:00,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 03:26:00,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:26:00,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 03:26:00,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 03:26:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-23 03:26:00,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:26:03,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-23 03:26:03,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4001)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 03:26:03,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:26:03,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191396171] [2022-11-23 03:26:03,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191396171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:26:03,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2022356363] [2022-11-23 03:26:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:26:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:26:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:26:03,461 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:26:03,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-23 03:26:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:26:08,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 03:26:08,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:26:08,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:26:08,393 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:26:08,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:26:08,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:26:08,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 03:26:08,651 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4428)))) is different from true [2022-11-23 03:26:08,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4429)))) is different from true [2022-11-23 03:26:09,416 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445)))) is different from true [2022-11-23 03:26:09,581 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:09,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452)))) is different from true [2022-11-23 03:26:09,852 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456)))) is different from true [2022-11-23 03:26:10,134 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:10,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:10,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:10,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:26:10,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 03:26:10,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:26:10,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 03:26:10,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 03:26:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2022-11-23 03:26:10,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:26:13,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4517))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4001)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 03:26:13,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2022356363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:26:13,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:26:13,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 21 [2022-11-23 03:26:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824654831] [2022-11-23 03:26:13,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:26:13,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 03:26:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:26:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 03:26:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=126, Unknown=26, NotChecked=540, Total=756 [2022-11-23 03:26:13,164 INFO L87 Difference]: Start difference. First operand 1178 states and 1435 transitions. Second operand has 22 states, 20 states have (on average 5.0) internal successors, (100), 22 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:26:14,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3957))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3989) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4428))) (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_3996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3996)))) is different from true [2022-11-23 03:26:14,489 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3957))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3989) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4429))) (exists ((v_ArrVal_4428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4428))) (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_3996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3996)))) is different from true [2022-11-23 03:26:14,498 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3957))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:26:28,199 INFO L93 Difference]: Finished difference Result 1184 states and 1441 transitions. [2022-11-23 03:26:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:26:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.0) internal successors, (100), 22 states have internal predecessors, (100), 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 120 [2022-11-23 03:26:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:26:28,203 INFO L225 Difference]: With dead ends: 1184 [2022-11-23 03:26:28,204 INFO L226 Difference]: Without dead ends: 1184 [2022-11-23 03:26:28,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 147 SyntacticMatches, 79 SemanticMatches, 32 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=89, Invalid=191, Unknown=32, NotChecked=810, Total=1122 [2022-11-23 03:26:28,205 INFO L413 NwaCegarLoop]: 541 mSDtfsCounter, 799 mSDsluCounter, 2791 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 8 mSolverCounterUnsat, 836 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 15652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 836 IncrementalHoareTripleChecker+Unknown, 11595 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:26:28,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 3332 Invalid, 15652 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 3213 Invalid, 836 Unknown, 11595 Unchecked, 14.7s Time] [2022-11-23 03:26:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-11-23 03:26:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1177. [2022-11-23 03:26:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 789 states have (on average 1.7604562737642586) internal successors, (1389), 1165 states have internal predecessors, (1389), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 03:26:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1434 transitions. [2022-11-23 03:26:28,226 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1434 transitions. Word has length 120 [2022-11-23 03:26:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:26:28,226 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1434 transitions. [2022-11-23 03:26:28,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.0) internal successors, (100), 22 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:26:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1434 transitions. [2022-11-23 03:26:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-23 03:26:28,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:26:28,229 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:26:28,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-23 03:26:28,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-23 03:26:28,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt [2022-11-23 03:26:28,653 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-23 03:26:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:26:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1053460857, now seen corresponding path program 1 times [2022-11-23 03:26:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:26:28,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905022364] [2022-11-23 03:26:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:26:28,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:26:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:26:28,655 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:26:28,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-23 03:26:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:26:29,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 03:26:29,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:26:29,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:26:29,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:26:29,981 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:26:29,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 03:26:30,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:26:30,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:26:30,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 03:26:30,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 03:26:30,273 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4899) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4900) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:30,289 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4901))) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902)))) is different from true [2022-11-23 03:26:30,304 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:30,322 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 03:26:30,338 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (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-11-23 03:26:30,353 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:30,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912)))) is different from true [2022-11-23 03:26:30,385 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4913))) (exists ((v_ArrVal_4914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4914) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:30,456 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:30,513 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922))) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921)))) is different from true [2022-11-23 03:26:30,529 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4923))) (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:30,608 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927)))) is different from true [2022-11-23 03:26:30,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-23 03:26:30,646 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-23 03:26:30,734 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935)))) is different from true [2022-11-23 03:26:30,752 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937)))) is different from true [2022-11-23 03:26:30,817 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941)))) is different from true [2022-11-23 03:26:30,928 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947)))) is different from true [2022-11-23 03:26:30,944 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950)))) is different from true [2022-11-23 03:26:30,960 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951))) (exists ((v_ArrVal_4952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4952)))) is different from true [2022-11-23 03:26:30,976 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4953) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:30,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:31,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4958))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957)))) is different from true [2022-11-23 03:26:31,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4959))) (exists ((v_ArrVal_4960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4960)))) is different from true [2022-11-23 03:26:31,043 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:31,058 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4963))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964)))) is different from true [2022-11-23 03:26:31,074 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:31,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968))) (exists ((v_ArrVal_4967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4967) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:31,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4970)))) is different from true [2022-11-23 03:26:31,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:31,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4973))) (exists ((v_ArrVal_4974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4974))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:31,153 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4975))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:31,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:26:31,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979)))) is different from true [2022-11-23 03:26:31,200 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4982) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:26:31,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4983))) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:31,232 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:26:31,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:26:31,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 03:26:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 03:26:31,481 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:26:31,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 03:26:31,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 03:26:31,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 03:26:31,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:26:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 962 not checked. [2022-11-23 03:26:31,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:26:31,819 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-23 03:26:31,865 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_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-23 03:26:33,151 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5079))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5080) .cse0 v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5080) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-23 03:26:33,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:26:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905022364] [2022-11-23 03:26:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905022364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:26:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [832684658] [2022-11-23 03:26:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:26:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:26:33,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:26:33,169 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:26:33,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e634442-7b82-4c4e-bc74-e3cd0f6c0c8b/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-23 03:28:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:28:44,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 03:28:44,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:28:44,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:28:44,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:28:44,270 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:28:44,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 03:28:44,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:28:44,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:28:44,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 03:28:44,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 03:28:44,523 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5462 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5462) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5463)))) is different from true [2022-11-23 03:28:44,542 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5464) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5465)))) is different from true [2022-11-23 03:28:44,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5467) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5466)))) is different from true [2022-11-23 03:28:44,577 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5469))) (exists ((v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5468))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:28:44,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5471))) (exists ((v_ArrVal_5470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5470) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:28:44,612 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5472) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5473)))) is different from true [2022-11-23 03:28:44,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477)))) is different from true [2022-11-23 03:28:44,726 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481)))) is different from true [2022-11-23 03:28:44,741 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5483) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5482)))) is different from true [2022-11-23 03:28:44,757 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5484) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5485)))) is different from true [2022-11-23 03:28:44,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5486) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5487)))) is different from true [2022-11-23 03:28:44,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5488))) (exists ((v_ArrVal_5489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5489)))) is different from true [2022-11-23 03:28:44,808 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5490))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491)))) is different from true [2022-11-23 03:28:44,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_5493 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5493))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:28:44,843 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5495))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5494)))) is different from true [2022-11-23 03:28:44,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496)))) is different from true [2022-11-23 03:28:44,879 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5499) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:28:44,897 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500)))) is different from true [2022-11-23 03:28:44,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502)))) is different from true [2022-11-23 03:28:44,981 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507)))) is different from true [2022-11-23 03:28:45,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509)))) is different from true [2022-11-23 03:28:45,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511)))) is different from true [2022-11-23 03:28:45,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_5514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5514)))) is different from true [2022-11-23 03:28:45,114 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517)))) is different from true [2022-11-23 03:28:45,131 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518)))) is different from true [2022-11-23 03:28:45,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520)))) is different from true [2022-11-23 03:28:45,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5523) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5522))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:28:45,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525))) (exists ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5524) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:28:45,276 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-23 03:28:45,333 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535)))) is different from true [2022-11-23 03:28:45,349 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:28:45,365 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:28:45,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540)))) is different from true [2022-11-23 03:28:45,397 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:28:45,413 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:28:45,429 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5546))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547)))) is different from true [2022-11-23 03:28:45,446 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:28:45,502 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:28:45,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 03:28:45,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 03:28:45,625 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:28:45,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 03:28:45,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-11-23 03:28:45,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 03:28:45,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:28:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 962 not checked. [2022-11-23 03:28:45,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:28:45,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 03:28:45,859 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_5550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-23 03:28:47,125 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5643) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5642))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5643) .cse2 v_ArrVal_5550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-23 03:28:47,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [832684658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:28:47,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:28:47,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 83 [2022-11-23 03:28:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308689883] [2022-11-23 03:28:47,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:28:47,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-23 03:28:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:28:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-23 03:28:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=178, Unknown=87, NotChecked=7920, Total=8372 [2022-11-23 03:28:47,143 INFO L87 Difference]: Start difference. First operand 1177 states and 1434 transitions. Second operand has 84 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 84 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:28:48,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_ArrVal_5464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5464) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530))) (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531))) (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5465))) (exists ((v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4901))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477))) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_5514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5514))) (exists ((v_ArrVal_4915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4915))) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922))) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:29:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:29:05,286 INFO L93 Difference]: Finished difference Result 1194 states and 1452 transitions. [2022-11-23 03:29:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:29:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 84 states have internal predecessors, (163), 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 120 [2022-11-23 03:29:05,287 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-23 03:29:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 84 states have internal predecessors, (163), 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 120