./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.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_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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_2c934515-6c1f-466e-b981-de2fe6f25615/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 c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 --- 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:13:15,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:13:15,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:13:15,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:13:15,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:13:15,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:13:15,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:13:15,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:13:15,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:13:15,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:13:15,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:13:15,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:13:15,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:13:15,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:13:15,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:13:15,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:13:15,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:13:15,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:13:15,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:13:15,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:13:15,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:13:15,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:13:15,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:13:15,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:13:15,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:13:15,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:13:15,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:13:15,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:13:15,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:13:15,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:13:15,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:13:15,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:13:15,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:13:15,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:13:15,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:13:15,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:13:15,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:13:15,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:13:15,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:13:15,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:13:15,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:13:15,213 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:13:15,256 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:13:15,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:13:15,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:13:15,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:13:15,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:13:15,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:13:15,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:13:15,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:13:15,260 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:13:15,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:13:15,261 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:13:15,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:13:15,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:13:15,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:13:15,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:13:15,262 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:13:15,262 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:13:15,263 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:13:15,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:13:15,263 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:13:15,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:13:15,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:13:15,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:13:15,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:13:15,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:13:15,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:13:15,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:13:15,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:13:15,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:13:15,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:13:15,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:13:15,266 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:13:15,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:13:15,267 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_2c934515-6c1f-466e-b981-de2fe6f25615/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_2c934515-6c1f-466e-b981-de2fe6f25615/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 -> c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 [2022-11-23 03:13:15,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:13:15,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:13:15,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:13:15,608 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:13:15,609 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:13:15,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-23 03:13:18,583 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:13:19,044 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:13:19,045 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-23 03:13:19,065 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data/e1a4d62ba/a9c0587c48ef4b9593b288524947958f/FLAGf43570364 [2022-11-23 03:13:19,086 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data/e1a4d62ba/a9c0587c48ef4b9593b288524947958f [2022-11-23 03:13:19,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:13:19,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:13:19,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:13:19,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:13:19,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:13:19,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:19" (1/1) ... [2022-11-23 03:13:19,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fcbdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:19, skipping insertion in model container [2022-11-23 03:13:19,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:19" (1/1) ... [2022-11-23 03:13:19,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:13:19,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:13:19,686 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_2c934515-6c1f-466e-b981-de2fe6f25615/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-23 03:13:19,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:13:20,017 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:13:20,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73d3003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:20, skipping insertion in model container [2022-11-23 03:13:20,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:13:20,019 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 03:13:20,020 INFO L158 Benchmark]: Toolchain (without parser) took 924.72ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 116.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-23 03:13:20,021 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory was 75.3MB in the beginning and 75.1MB in the end (delta: 110.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:13:20,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 922.29ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 116.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-23 03:13:20,023 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.27ms. Allocated memory is still 134.2MB. Free memory was 75.3MB in the beginning and 75.1MB in the end (delta: 110.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 922.29ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 116.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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_2c934515-6c1f-466e-b981-de2fe6f25615/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 c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 --- 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:13:22,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:13:22,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:13:22,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:13:22,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:13:22,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:13:22,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:13:22,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:13:22,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:13:22,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:13:22,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:13:22,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:13:22,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:13:22,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:13:22,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:13:22,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:13:22,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:13:22,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:13:22,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:13:22,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:13:22,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:13:22,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:13:22,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:13:22,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:13:22,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:13:22,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:13:22,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:13:22,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:13:22,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:13:22,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:13:22,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:13:22,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:13:22,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:13:22,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:13:22,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:13:22,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:13:22,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:13:22,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:13:22,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:13:22,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:13:22,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:13:22,415 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 03:13:22,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:13:22,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:13:22,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:13:22,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:13:22,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:13:22,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:13:22,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:13:22,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:13:22,463 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:13:22,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:13:22,465 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:13:22,465 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:13:22,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:13:22,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:13:22,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:13:22,466 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:13:22,466 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:13:22,466 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:13:22,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:13:22,467 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:13:22,467 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 03:13:22,467 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 03:13:22,467 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:13:22,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:13:22,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:13:22,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:13:22,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:13:22,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:13:22,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:13:22,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:13:22,469 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 03:13:22,469 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 03:13:22,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:13:22,470 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:13:22,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:13:22,471 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 03:13:22,471 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_2c934515-6c1f-466e-b981-de2fe6f25615/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_2c934515-6c1f-466e-b981-de2fe6f25615/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 -> c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 [2022-11-23 03:13:22,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:13:22,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:13:22,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:13:22,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:13:22,893 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:13:22,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-23 03:13:26,053 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:13:26,489 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:13:26,495 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-23 03:13:26,523 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data/c84ae4381/1670e78327ac4383b90148da30bc786a/FLAG589281203 [2022-11-23 03:13:26,543 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/data/c84ae4381/1670e78327ac4383b90148da30bc786a [2022-11-23 03:13:26,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:13:26,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:13:26,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:13:26,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:13:26,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:13:26,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:26" (1/1) ... [2022-11-23 03:13:26,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586564ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:26, skipping insertion in model container [2022-11-23 03:13:26,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:26" (1/1) ... [2022-11-23 03:13:26,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:13:26,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:13:27,157 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_2c934515-6c1f-466e-b981-de2fe6f25615/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-23 03:13:27,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:13:27,574 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 03:13:27,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:13:27,631 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_2c934515-6c1f-466e-b981-de2fe6f25615/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-23 03:13:27,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:13:27,792 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:13:27,854 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_2c934515-6c1f-466e-b981-de2fe6f25615/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-23 03:13:27,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:13:28,000 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:13:28,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28 WrapperNode [2022-11-23 03:13:28,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:13:28,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:13:28,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:13:28,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:13:28,010 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:13:28" (1/1) ... [2022-11-23 03:13:28,072 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:13:28" (1/1) ... [2022-11-23 03:13:28,197 INFO L138 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2483 [2022-11-23 03:13:28,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:13:28,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:13:28,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:13:28,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:13:28,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:13:28,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:13:28,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:13:28,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:13:28,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (1/1) ... [2022-11-23 03:13:28,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:13:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:13:28,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:13:28,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:13:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 03:13:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-23 03:13:28,484 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-23 03:13:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 03:13:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 03:13:28,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 03:13:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-23 03:13:28,485 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-23 03:13:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:13:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:13:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:13:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:13:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-23 03:13:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:13:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:13:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 03:13:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 03:13:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:13:28,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:13:28,821 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:13:28,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:13:28,827 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 03:13:39,334 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:13:39,351 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:13:39,352 INFO L300 CfgBuilder]: Removed 168 assume(true) statements. [2022-11-23 03:13:39,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:39 BoogieIcfgContainer [2022-11-23 03:13:39,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:13:39,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:13:39,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:13:39,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:13:39,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:13:26" (1/3) ... [2022-11-23 03:13:39,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b5e635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:13:39, skipping insertion in model container [2022-11-23 03:13:39,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:28" (2/3) ... [2022-11-23 03:13:39,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b5e635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:13:39, skipping insertion in model container [2022-11-23 03:13:39,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:39" (3/3) ... [2022-11-23 03:13:39,366 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-3.i [2022-11-23 03:13:39,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:13:39,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2022-11-23 03:13:39,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:13:39,500 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;@5c03b690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:13:39,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2022-11-23 03:13:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 2435 states, 1230 states have (on average 2.2284552845528456) internal successors, (2741), 2421 states have internal predecessors, (2741), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 03:13:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 03:13:39,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:13:39,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 03:13:39,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:13:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:13:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-23 03:13:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:13:39,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843566723] [2022-11-23 03:13:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:13:39,544 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:13:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:13:39,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:39,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:13:39,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:13:39,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:13:39,947 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:13:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:13:39,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:13:39,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:13:39,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843566723] [2022-11-23 03:13:39,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843566723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:13:39,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:13:39,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:13:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330017857] [2022-11-23 03:13:39,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:13:39,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:13:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:13:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:13:40,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:13:40,060 INFO L87 Difference]: Start difference. First operand has 2435 states, 1230 states have (on average 2.2284552845528456) internal successors, (2741), 2421 states have internal predecessors, (2741), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:13:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:13:45,613 INFO L93 Difference]: Finished difference Result 3278 states and 3477 transitions. [2022-11-23 03:13:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:13:45,615 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:13:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:13:45,645 INFO L225 Difference]: With dead ends: 3278 [2022-11-23 03:13:45,646 INFO L226 Difference]: Without dead ends: 3276 [2022-11-23 03:13:45,647 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:13:45,651 INFO L413 NwaCegarLoop]: 1661 mSDtfsCounter, 2314 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:13:45,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 2224 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-23 03:13:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-11-23 03:13:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 2577. [2022-11-23 03:13:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2577 states, 1396 states have (on average 2.067335243553009) internal successors, (2886), 2561 states have internal predecessors, (2886), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-23 03:13:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 2918 transitions. [2022-11-23 03:13:45,835 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 2918 transitions. Word has length 3 [2022-11-23 03:13:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:13:45,835 INFO L495 AbstractCegarLoop]: Abstraction has 2577 states and 2918 transitions. [2022-11-23 03:13:45,836 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:13:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 2918 transitions. [2022-11-23 03:13:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 03:13:45,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:13:45,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 03:13:45,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Ended with exit code 0 [2022-11-23 03:13:46,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:46,049 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:13:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:13:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-23 03:13:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:13:46,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277497688] [2022-11-23 03:13:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:13:46,051 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:13:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:13:46,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:46,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:13:46,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:13:46,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:13:46,295 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:13:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:13:46,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:13:46,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:13:46,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277497688] [2022-11-23 03:13:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277497688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:13:46,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:13:46,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:13:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675569905] [2022-11-23 03:13:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:13:46,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:13:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:13:46,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:13:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:13:46,326 INFO L87 Difference]: Start difference. First operand 2577 states and 2918 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:13:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:13:54,604 INFO L93 Difference]: Finished difference Result 3725 states and 4166 transitions. [2022-11-23 03:13:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:13:54,606 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:13:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:13:54,617 INFO L225 Difference]: With dead ends: 3725 [2022-11-23 03:13:54,618 INFO L226 Difference]: Without dead ends: 3725 [2022-11-23 03:13:54,618 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:13:54,619 INFO L413 NwaCegarLoop]: 2041 mSDtfsCounter, 1240 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:13:54,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 3425 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-11-23 03:13:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2022-11-23 03:13:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3026. [2022-11-23 03:13:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 1843 states have (on average 2.023331524688009) internal successors, (3729), 3007 states have internal predecessors, (3729), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-23 03:13:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 3767 transitions. [2022-11-23 03:13:54,692 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 3767 transitions. Word has length 3 [2022-11-23 03:13:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:13:54,692 INFO L495 AbstractCegarLoop]: Abstraction has 3026 states and 3767 transitions. [2022-11-23 03:13:54,692 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:13:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 3767 transitions. [2022-11-23 03:13:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 03:13:54,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:13:54,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:13:54,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:54,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:54,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:13:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:13:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-23 03:13:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:13:54,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970226468] [2022-11-23 03:13:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:13:54,907 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:13:54,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:13:54,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:54,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:13:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:13:55,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:13:55,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:13:55,166 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:13:55,176 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:13:55,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:13:55,266 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:13:55,286 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:13:55,287 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:13:55,312 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:13:55,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:13:55,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:13:55,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970226468] [2022-11-23 03:13:55,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970226468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:13:55,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:13:55,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:13:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150018475] [2022-11-23 03:13:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:13:55,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:13:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:13:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:13:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:13:55,315 INFO L87 Difference]: Start difference. First operand 3026 states and 3767 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:14:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:11,296 INFO L93 Difference]: Finished difference Result 6002 states and 6929 transitions. [2022-11-23 03:14:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:14:11,298 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:14:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:11,314 INFO L225 Difference]: With dead ends: 6002 [2022-11-23 03:14:11,315 INFO L226 Difference]: Without dead ends: 6002 [2022-11-23 03:14:11,315 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:14:11,316 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 3126 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3136 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 4744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:14:11,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3136 Valid, 3150 Invalid, 4744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2022-11-23 03:14:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2022-11-23 03:14:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3743. [2022-11-23 03:14:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2560 states have (on average 2.0515625) internal successors, (5252), 3718 states have internal predecessors, (5252), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5302 transitions. [2022-11-23 03:14:11,410 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5302 transitions. Word has length 7 [2022-11-23 03:14:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:11,410 INFO L495 AbstractCegarLoop]: Abstraction has 3743 states and 5302 transitions. [2022-11-23 03:14:11,411 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:14:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5302 transitions. [2022-11-23 03:14:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 03:14:11,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:11,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:11,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:11,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:11,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:11,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-23 03:14:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:11,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055948595] [2022-11-23 03:14:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:11,625 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:14:11,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:11,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:11,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:11,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:14:11,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:11,857 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:14:11,871 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:14:11,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:11,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:11,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055948595] [2022-11-23 03:14:11,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055948595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:11,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:11,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:14:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749702093] [2022-11-23 03:14:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:11,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:14:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:14:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:11,875 INFO L87 Difference]: Start difference. First operand 3743 states and 5302 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:14:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:16,632 INFO L93 Difference]: Finished difference Result 4947 states and 6819 transitions. [2022-11-23 03:14:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:14:16,632 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:14:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:16,651 INFO L225 Difference]: With dead ends: 4947 [2022-11-23 03:14:16,651 INFO L226 Difference]: Without dead ends: 4947 [2022-11-23 03:14:16,652 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:14:16,653 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 1994 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:14:16,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 3208 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-23 03:14:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2022-11-23 03:14:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 3652. [2022-11-23 03:14:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2560 states have (on average 1.968359375) internal successors, (5039), 3627 states have internal predecessors, (5039), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5089 transitions. [2022-11-23 03:14:16,740 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5089 transitions. Word has length 8 [2022-11-23 03:14:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:16,740 INFO L495 AbstractCegarLoop]: Abstraction has 3652 states and 5089 transitions. [2022-11-23 03:14:16,740 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:14:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5089 transitions. [2022-11-23 03:14:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 03:14:16,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:16,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:16,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:14:16,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:16,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-23 03:14:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:16,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269937159] [2022-11-23 03:14:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:16,954 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:14:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:16,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:16,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:17,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:14:17,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:17,229 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:14:17,263 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:14:17,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:17,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:17,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269937159] [2022-11-23 03:14:17,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269937159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:17,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:17,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:14:17,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63300710] [2022-11-23 03:14:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:14:17,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:17,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:14:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:17,266 INFO L87 Difference]: Start difference. First operand 3652 states and 5089 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:14:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:24,959 INFO L93 Difference]: Finished difference Result 5367 states and 7447 transitions. [2022-11-23 03:14:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:14:24,960 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:14:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:24,981 INFO L225 Difference]: With dead ends: 5367 [2022-11-23 03:14:24,982 INFO L226 Difference]: Without dead ends: 5367 [2022-11-23 03:14:24,982 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:14:24,983 INFO L413 NwaCegarLoop]: 2742 mSDtfsCounter, 1369 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:14:24,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3923 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-23 03:14:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-11-23 03:14:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 3974. [2022-11-23 03:14:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 2892 states have (on average 1.9540110650069156) internal successors, (5651), 3949 states have internal predecessors, (5651), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5701 transitions. [2022-11-23 03:14:25,067 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5701 transitions. Word has length 8 [2022-11-23 03:14:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:25,067 INFO L495 AbstractCegarLoop]: Abstraction has 3974 states and 5701 transitions. [2022-11-23 03:14:25,068 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:14:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5701 transitions. [2022-11-23 03:14:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 03:14:25,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:25,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:25,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-11-23 03:14:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689663838] [2022-11-23 03:14:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:25,281 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:14:25,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:25,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:25,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:14:25,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:25,526 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:14:25,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:25,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689663838] [2022-11-23 03:14:25,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689663838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:25,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:25,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:25,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456876985] [2022-11-23 03:14:25,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:25,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:14:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:25,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:14:25,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:25,529 INFO L87 Difference]: Start difference. First operand 3974 states and 5701 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:25,590 INFO L93 Difference]: Finished difference Result 3914 states and 5615 transitions. [2022-11-23 03:14:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:14:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 03:14:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:25,634 INFO L225 Difference]: With dead ends: 3914 [2022-11-23 03:14:25,635 INFO L226 Difference]: Without dead ends: 3914 [2022-11-23 03:14:25,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:25,638 INFO L413 NwaCegarLoop]: 2403 mSDtfsCounter, 1197 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3615 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:14:25,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3615 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:14:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2022-11-23 03:14:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3914. [2022-11-23 03:14:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 2856 states have (on average 1.9485294117647058) internal successors, (5565), 3889 states have internal predecessors, (5565), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5615 transitions. [2022-11-23 03:14:25,714 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 5615 transitions. Word has length 11 [2022-11-23 03:14:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:25,716 INFO L495 AbstractCegarLoop]: Abstraction has 3914 states and 5615 transitions. [2022-11-23 03:14:25,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 5615 transitions. [2022-11-23 03:14:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 03:14:25,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:25,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:25,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-11-23 03:14:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:25,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702065639] [2022-11-23 03:14:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:25,929 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:14:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:25,931 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:25,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:26,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:14:26,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:26,168 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:14:26,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:26,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702065639] [2022-11-23 03:14:26,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702065639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:26,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:26,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:14:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213475525] [2022-11-23 03:14:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:26,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:26,172 INFO L87 Difference]: Start difference. First operand 3914 states and 5615 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:26,294 INFO L93 Difference]: Finished difference Result 3886 states and 5559 transitions. [2022-11-23 03:14:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:14:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 03:14:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:26,315 INFO L225 Difference]: With dead ends: 3886 [2022-11-23 03:14:26,316 INFO L226 Difference]: Without dead ends: 3886 [2022-11-23 03:14:26,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:14:26,317 INFO L413 NwaCegarLoop]: 2358 mSDtfsCounter, 1178 mSDsluCounter, 3563 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 5921 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:14:26,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 5921 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:14:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2022-11-23 03:14:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3884. [2022-11-23 03:14:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 2840 states have (on average 1.9390845070422535) internal successors, (5507), 3859 states have internal predecessors, (5507), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5557 transitions. [2022-11-23 03:14:26,413 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5557 transitions. Word has length 13 [2022-11-23 03:14:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:26,414 INFO L495 AbstractCegarLoop]: Abstraction has 3884 states and 5557 transitions. [2022-11-23 03:14:26,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5557 transitions. [2022-11-23 03:14:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 03:14:26,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:26,416 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:14:26,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:26,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:26,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-23 03:14:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:26,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071219081] [2022-11-23 03:14:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:26,631 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:14:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:26,632 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:26,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:26,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:14:26,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:26,929 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:14:26,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:26,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071219081] [2022-11-23 03:14:26,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071219081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:26,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:26,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947223672] [2022-11-23 03:14:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:26,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:14:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:14:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:26,932 INFO L87 Difference]: Start difference. First operand 3884 states and 5557 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:27,015 INFO L93 Difference]: Finished difference Result 5509 states and 7308 transitions. [2022-11-23 03:14:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:14:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 03:14:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:27,028 INFO L225 Difference]: With dead ends: 5509 [2022-11-23 03:14:27,028 INFO L226 Difference]: Without dead ends: 5509 [2022-11-23 03:14:27,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:27,029 INFO L413 NwaCegarLoop]: 3864 mSDtfsCounter, 2284 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 5664 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:14:27,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 5664 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:14:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2022-11-23 03:14:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 3824. [2022-11-23 03:14:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2804 states have (on average 1.9333095577746078) internal successors, (5421), 3799 states have internal predecessors, (5421), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5471 transitions. [2022-11-23 03:14:27,103 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5471 transitions. Word has length 20 [2022-11-23 03:14:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:27,104 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 5471 transitions. [2022-11-23 03:14:27,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5471 transitions. [2022-11-23 03:14:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 03:14:27,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:27,106 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:14:27,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:27,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:27,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-11-23 03:14:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:27,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628293495] [2022-11-23 03:14:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:14:27,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:27,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:27,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:27,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:14:27,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:27,633 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:14:27,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:27,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:27,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628293495] [2022-11-23 03:14:27,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628293495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:27,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:27,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648417431] [2022-11-23 03:14:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:27,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:14:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:27,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:14:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:27,636 INFO L87 Difference]: Start difference. First operand 3824 states and 5471 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:27,703 INFO L93 Difference]: Finished difference Result 5342 states and 7017 transitions. [2022-11-23 03:14:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:14:27,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 03:14:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:27,717 INFO L225 Difference]: With dead ends: 5342 [2022-11-23 03:14:27,717 INFO L226 Difference]: Without dead ends: 5342 [2022-11-23 03:14:27,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:14:27,720 INFO L413 NwaCegarLoop]: 3774 mSDtfsCounter, 2241 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 5526 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:14:27,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2251 Valid, 5526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:14:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2022-11-23 03:14:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 3692. [2022-11-23 03:14:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2696 states have (on average 1.915059347181009) internal successors, (5163), 3667 states have internal predecessors, (5163), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5213 transitions. [2022-11-23 03:14:27,824 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5213 transitions. Word has length 20 [2022-11-23 03:14:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:27,825 INFO L495 AbstractCegarLoop]: Abstraction has 3692 states and 5213 transitions. [2022-11-23 03:14:27,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5213 transitions. [2022-11-23 03:14:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 03:14:27,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:27,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:27,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,038 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-23 03:14:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:28,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813705727] [2022-11-23 03:14:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:28,040 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:14:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:28,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:28,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:14:28,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:28,360 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:14:28,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:28,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813705727] [2022-11-23 03:14:28,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813705727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:28,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:28,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:14:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987527719] [2022-11-23 03:14:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:28,363 INFO L87 Difference]: Start difference. First operand 3692 states and 5213 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:28,507 INFO L93 Difference]: Finished difference Result 5307 states and 6951 transitions. [2022-11-23 03:14:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:14:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 03:14:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:28,519 INFO L225 Difference]: With dead ends: 5307 [2022-11-23 03:14:28,520 INFO L226 Difference]: Without dead ends: 5307 [2022-11-23 03:14:28,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:14:28,520 INFO L413 NwaCegarLoop]: 3954 mSDtfsCounter, 2222 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 9658 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:14:28,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 9658 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:14:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2022-11-23 03:14:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 3662. [2022-11-23 03:14:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2680 states have (on average 1.9048507462686568) internal successors, (5105), 3637 states have internal predecessors, (5105), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5155 transitions. [2022-11-23 03:14:28,587 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5155 transitions. Word has length 22 [2022-11-23 03:14:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:28,587 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 5155 transitions. [2022-11-23 03:14:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5155 transitions. [2022-11-23 03:14:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 03:14:28,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:28,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:28,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,805 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-11-23 03:14:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:28,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022615332] [2022-11-23 03:14:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:28,806 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:14:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:28,807 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:28,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:29,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:14:29,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:29,139 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:14:29,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:29,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:29,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022615332] [2022-11-23 03:14:29,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022615332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:29,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:14:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330005439] [2022-11-23 03:14:29,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:29,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:29,142 INFO L87 Difference]: Start difference. First operand 3662 states and 5155 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:29,273 INFO L93 Difference]: Finished difference Result 5234 states and 6762 transitions. [2022-11-23 03:14:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:14:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 03:14:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:29,285 INFO L225 Difference]: With dead ends: 5234 [2022-11-23 03:14:29,285 INFO L226 Difference]: Without dead ends: 5234 [2022-11-23 03:14:29,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:14:29,286 INFO L413 NwaCegarLoop]: 3879 mSDtfsCounter, 2187 mSDsluCounter, 5589 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 9468 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:14:29,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 9468 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:14:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2022-11-23 03:14:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 3600. [2022-11-23 03:14:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2632 states have (on average 1.8734802431610942) internal successors, (4931), 3575 states have internal predecessors, (4931), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2022-11-23 03:14:29,348 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 22 [2022-11-23 03:14:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:29,350 INFO L495 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2022-11-23 03:14:29,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2022-11-23 03:14:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 03:14:29,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:29,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:29,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:14:29,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:29,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-11-23 03:14:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:29,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745837340] [2022-11-23 03:14:29,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:29,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:14:29,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:29,568 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:29,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:29,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:14:29,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:29,809 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:14:29,911 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:14:29,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:29,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:29,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745837340] [2022-11-23 03:14:29,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745837340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:29,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:29,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254081335] [2022-11-23 03:14:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:29,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:29,914 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:35,568 INFO L93 Difference]: Finished difference Result 4220 states and 5515 transitions. [2022-11-23 03:14:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:14:35,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 03:14:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:35,576 INFO L225 Difference]: With dead ends: 4220 [2022-11-23 03:14:35,577 INFO L226 Difference]: Without dead ends: 4220 [2022-11-23 03:14:35,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:14:35,577 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 3093 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:14:35,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 2783 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-23 03:14:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2022-11-23 03:14:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3596. [2022-11-23 03:14:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 2632 states have (on average 1.8704407294832828) internal successors, (4923), 3571 states have internal predecessors, (4923), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4973 transitions. [2022-11-23 03:14:35,629 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4973 transitions. Word has length 27 [2022-11-23 03:14:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:35,630 INFO L495 AbstractCegarLoop]: Abstraction has 3596 states and 4973 transitions. [2022-11-23 03:14:35,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4973 transitions. [2022-11-23 03:14:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 03:14:35,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:35,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:35,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Ended with exit code 0 [2022-11-23 03:14:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:35,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-11-23 03:14:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589864942] [2022-11-23 03:14:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:35,844 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:14:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:35,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:35,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:36,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:14:36,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:36,087 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:14:36,269 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:14:36,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:36,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589864942] [2022-11-23 03:14:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589864942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:36,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:36,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359385831] [2022-11-23 03:14:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:36,271 INFO L87 Difference]: Start difference. First operand 3596 states and 4973 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:45,073 INFO L93 Difference]: Finished difference Result 4675 states and 6143 transitions. [2022-11-23 03:14:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:14:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 03:14:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:45,083 INFO L225 Difference]: With dead ends: 4675 [2022-11-23 03:14:45,083 INFO L226 Difference]: Without dead ends: 4675 [2022-11-23 03:14:45,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:14:45,084 INFO L413 NwaCegarLoop]: 1744 mSDtfsCounter, 2280 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 4087 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:14:45,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 4087 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-23 03:14:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-11-23 03:14:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3632. [2022-11-23 03:14:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2668 states have (on average 1.8605697151424287) internal successors, (4964), 3607 states have internal predecessors, (4964), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2022-11-23 03:14:45,138 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 27 [2022-11-23 03:14:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:45,138 INFO L495 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2022-11-23 03:14:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2022-11-23 03:14:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:14:45,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:45,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:45,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:45,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:45,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-23 03:14:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:45,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160917533] [2022-11-23 03:14:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:45,352 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:14:45,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:45,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:45,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:45,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:14:45,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:45,658 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:14:45,743 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:14:45,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:45,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160917533] [2022-11-23 03:14:45,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160917533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:45,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:45,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923909289] [2022-11-23 03:14:45,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:45,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:45,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:45,745 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:14:53,579 INFO L93 Difference]: Finished difference Result 7027 states and 9544 transitions. [2022-11-23 03:14:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:14:53,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-23 03:14:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:14:53,595 INFO L225 Difference]: With dead ends: 7027 [2022-11-23 03:14:53,595 INFO L226 Difference]: Without dead ends: 7027 [2022-11-23 03:14:53,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:14:53,596 INFO L413 NwaCegarLoop]: 2706 mSDtfsCounter, 4281 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4288 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:14:53,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4288 Valid, 5103 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-23 03:14:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2022-11-23 03:14:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 3628. [2022-11-23 03:14:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2668 states have (on average 1.8575712143928036) internal successors, (4956), 3603 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:14:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2022-11-23 03:14:53,681 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2022-11-23 03:14:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:14:53,682 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2022-11-23 03:14:53,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:14:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2022-11-23 03:14:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:14:53,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:14:53,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:14:53,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:53,891 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:14:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:14:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-23 03:14:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:14:53,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090130733] [2022-11-23 03:14:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:14:53,893 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:14:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:14:53,895 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:53,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:14:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:14:54,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:14:54,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:14:54,230 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:14:54,453 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:14:54,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:14:54,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:14:54,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090130733] [2022-11-23 03:14:54,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090130733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:14:54,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:14:54,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:14:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10636579] [2022-11-23 03:14:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:14:54,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:14:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:14:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:14:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:14:54,455 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:06,297 INFO L93 Difference]: Finished difference Result 6721 states and 8949 transitions. [2022-11-23 03:15:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:15:06,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-23 03:15:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:06,307 INFO L225 Difference]: With dead ends: 6721 [2022-11-23 03:15:06,307 INFO L226 Difference]: Without dead ends: 6721 [2022-11-23 03:15:06,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:06,308 INFO L413 NwaCegarLoop]: 3191 mSDtfsCounter, 2831 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:06,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2835 Valid, 6079 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-11-23 03:15:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2022-11-23 03:15:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 3624. [2022-11-23 03:15:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 2668 states have (on average 1.8545727136431784) internal successors, (4948), 3599 states have internal predecessors, (4948), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:15:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4998 transitions. [2022-11-23 03:15:06,389 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4998 transitions. Word has length 36 [2022-11-23 03:15:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:06,391 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 4998 transitions. [2022-11-23 03:15:06,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4998 transitions. [2022-11-23 03:15:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:15:06,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:06,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:06,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:15:06,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:06,605 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:06,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-11-23 03:15:06,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:06,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74778711] [2022-11-23 03:15:06,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:06,606 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:15:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:06,608 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:06,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:06,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:15:06,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:06,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:15:06,993 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:15:06,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:06,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:06,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74778711] [2022-11-23 03:15:06,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74778711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:06,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:15:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584713146] [2022-11-23 03:15:06,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:06,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:06,996 INFO L87 Difference]: Start difference. First operand 3624 states and 4998 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:15,686 INFO L93 Difference]: Finished difference Result 7470 states and 10054 transitions. [2022-11-23 03:15:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:15:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-23 03:15:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:15,697 INFO L225 Difference]: With dead ends: 7470 [2022-11-23 03:15:15,697 INFO L226 Difference]: Without dead ends: 7470 [2022-11-23 03:15:15,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:15,698 INFO L413 NwaCegarLoop]: 2536 mSDtfsCounter, 4851 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4861 SdHoareTripleChecker+Valid, 5123 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:15,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4861 Valid, 5123 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-23 03:15:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2022-11-23 03:15:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 3621. [2022-11-23 03:15:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2668 states have (on average 1.8463268365817092) internal successors, (4926), 3596 states have internal predecessors, (4926), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:15:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4976 transitions. [2022-11-23 03:15:15,763 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4976 transitions. Word has length 36 [2022-11-23 03:15:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:15,763 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 4976 transitions. [2022-11-23 03:15:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4976 transitions. [2022-11-23 03:15:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:15:15,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:15,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:15,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:15,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:15,977 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-11-23 03:15:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:15,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249065545] [2022-11-23 03:15:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:15,979 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:15:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:15,980 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:16,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:16,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:15:16,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:16,305 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:15:16,519 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:15:16,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:16,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:16,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249065545] [2022-11-23 03:15:16,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249065545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:16,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:16,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:15:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084503865] [2022-11-23 03:15:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:16,520 INFO L87 Difference]: Start difference. First operand 3621 states and 4976 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:26,660 INFO L93 Difference]: Finished difference Result 5557 states and 7335 transitions. [2022-11-23 03:15:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:15:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-23 03:15:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:26,666 INFO L225 Difference]: With dead ends: 5557 [2022-11-23 03:15:26,666 INFO L226 Difference]: Without dead ends: 5557 [2022-11-23 03:15:26,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:26,666 INFO L413 NwaCegarLoop]: 2836 mSDtfsCounter, 2602 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:26,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 5297 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2022-11-23 03:15:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2022-11-23 03:15:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 3621. [2022-11-23 03:15:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2668 states have (on average 1.843328335832084) internal successors, (4918), 3596 states have internal predecessors, (4918), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:15:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4968 transitions. [2022-11-23 03:15:26,716 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4968 transitions. Word has length 36 [2022-11-23 03:15:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:26,717 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 4968 transitions. [2022-11-23 03:15:26,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4968 transitions. [2022-11-23 03:15:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 03:15:26,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:26,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:26,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Ended with exit code 0 [2022-11-23 03:15:26,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:26,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-11-23 03:15:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:26,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938724324] [2022-11-23 03:15:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:26,935 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:15:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:26,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:26,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:27,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:15:27,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:27,356 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:15:27,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:27,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:27,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938724324] [2022-11-23 03:15:27,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938724324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:27,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:27,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:15:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585918358] [2022-11-23 03:15:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:27,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:27,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:27,361 INFO L87 Difference]: Start difference. First operand 3621 states and 4968 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:27,442 INFO L93 Difference]: Finished difference Result 3609 states and 4944 transitions. [2022-11-23 03:15:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:15:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-23 03:15:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:27,447 INFO L225 Difference]: With dead ends: 3609 [2022-11-23 03:15:27,447 INFO L226 Difference]: Without dead ends: 3609 [2022-11-23 03:15:27,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:27,448 INFO L413 NwaCegarLoop]: 2189 mSDtfsCounter, 1155 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 5402 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:15:27,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 5402 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:15:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2022-11-23 03:15:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3609. [2022-11-23 03:15:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 2656 states have (on average 1.8426204819277108) internal successors, (4894), 3584 states have internal predecessors, (4894), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 03:15:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4944 transitions. [2022-11-23 03:15:27,491 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4944 transitions. Word has length 40 [2022-11-23 03:15:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:27,492 INFO L495 AbstractCegarLoop]: Abstraction has 3609 states and 4944 transitions. [2022-11-23 03:15:27,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4944 transitions. [2022-11-23 03:15:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 03:15:27,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:27,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:27,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:15:27,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:27,705 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-11-23 03:15:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:27,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689259845] [2022-11-23 03:15:27,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:27,706 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:15:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:27,708 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:27,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:28,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:15:28,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:28,266 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:15:28,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:28,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689259845] [2022-11-23 03:15:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689259845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:28,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:28,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:15:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866416716] [2022-11-23 03:15:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:28,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:15:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:15:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:15:28,268 INFO L87 Difference]: Start difference. First operand 3609 states and 4944 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:28,724 INFO L93 Difference]: Finished difference Result 5428 states and 7151 transitions. [2022-11-23 03:15:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:15:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-23 03:15:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:28,732 INFO L225 Difference]: With dead ends: 5428 [2022-11-23 03:15:28,732 INFO L226 Difference]: Without dead ends: 5428 [2022-11-23 03:15:28,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:15:28,733 INFO L413 NwaCegarLoop]: 2277 mSDtfsCounter, 1566 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:28,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 4312 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:15:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2022-11-23 03:15:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 4625. [2022-11-23 03:15:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 3665 states have (on average 1.8256480218281037) internal successors, (6691), 4590 states have internal predecessors, (6691), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 03:15:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6761 transitions. [2022-11-23 03:15:28,801 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6761 transitions. Word has length 48 [2022-11-23 03:15:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:28,801 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6761 transitions. [2022-11-23 03:15:28,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6761 transitions. [2022-11-23 03:15:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 03:15:28,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:28,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:28,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,015 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-11-23 03:15:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:29,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616163220] [2022-11-23 03:15:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:29,017 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:15:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:29,018 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:29,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:15:29,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:29,413 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:15:29,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:29,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616163220] [2022-11-23 03:15:29,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616163220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:29,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:29,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:15:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445134093] [2022-11-23 03:15:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:29,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:29,415 INFO L87 Difference]: Start difference. First operand 4625 states and 6761 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:29,508 INFO L93 Difference]: Finished difference Result 5936 states and 8133 transitions. [2022-11-23 03:15:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:15:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-23 03:15:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:29,521 INFO L225 Difference]: With dead ends: 5936 [2022-11-23 03:15:29,521 INFO L226 Difference]: Without dead ends: 5936 [2022-11-23 03:15:29,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:29,522 INFO L413 NwaCegarLoop]: 3648 mSDtfsCounter, 2150 mSDsluCounter, 5129 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 8777 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:15:29,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 8777 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:15:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2022-11-23 03:15:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 4583. [2022-11-23 03:15:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 3623 states have (on average 1.8274910295335358) internal successors, (6621), 4548 states have internal predecessors, (6621), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 03:15:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6691 transitions. [2022-11-23 03:15:29,585 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6691 transitions. Word has length 51 [2022-11-23 03:15:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:29,586 INFO L495 AbstractCegarLoop]: Abstraction has 4583 states and 6691 transitions. [2022-11-23 03:15:29,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6691 transitions. [2022-11-23 03:15:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-23 03:15:29,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:29,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:29,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,803 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-23 03:15:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:29,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404574938] [2022-11-23 03:15:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:15:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:29,806 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:29,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:30,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:15:30,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:30,255 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:15:30,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:30,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:30,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404574938] [2022-11-23 03:15:30,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404574938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:30,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:30,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:15:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640114176] [2022-11-23 03:15:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:30,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:30,258 INFO L87 Difference]: Start difference. First operand 4583 states and 6691 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:30,392 INFO L93 Difference]: Finished difference Result 5673 states and 7621 transitions. [2022-11-23 03:15:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:15:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-23 03:15:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:30,399 INFO L225 Difference]: With dead ends: 5673 [2022-11-23 03:15:30,399 INFO L226 Difference]: Without dead ends: 5673 [2022-11-23 03:15:30,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:30,401 INFO L413 NwaCegarLoop]: 3688 mSDtfsCounter, 2141 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 8906 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:15:30,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 8906 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:15:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2022-11-23 03:15:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 4565. [2022-11-23 03:15:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 3605 states have (on average 1.8282940360610263) internal successors, (6591), 4530 states have internal predecessors, (6591), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 03:15:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 6661 transitions. [2022-11-23 03:15:30,464 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 6661 transitions. Word has length 54 [2022-11-23 03:15:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:30,464 INFO L495 AbstractCegarLoop]: Abstraction has 4565 states and 6661 transitions. [2022-11-23 03:15:30,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 6661 transitions. [2022-11-23 03:15:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-23 03:15:30,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:30,465 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:15:30,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:30,679 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1638755906, now seen corresponding path program 1 times [2022-11-23 03:15:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:30,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444151446] [2022-11-23 03:15:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:30,680 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:15:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:30,682 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:30,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (23)] Waiting until timeout for monitored process [2022-11-23 03:15:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:31,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:15:31,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:31,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:15:31,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:15:31,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-11-23 03:15:31,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:15:31,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-11-23 03:15:31,138 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:15:31,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:31,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:31,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444151446] [2022-11-23 03:15:31,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444151446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:31,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:31,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:15:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944481860] [2022-11-23 03:15:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:31,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:31,141 INFO L87 Difference]: Start difference. First operand 4565 states and 6661 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:34,259 INFO L93 Difference]: Finished difference Result 4795 states and 6902 transitions. [2022-11-23 03:15:34,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:15:34,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-23 03:15:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:34,268 INFO L225 Difference]: With dead ends: 4795 [2022-11-23 03:15:34,268 INFO L226 Difference]: Without dead ends: 4795 [2022-11-23 03:15:34,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:15:34,268 INFO L413 NwaCegarLoop]: 2065 mSDtfsCounter, 1034 mSDsluCounter, 3289 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 5354 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:34,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 5354 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-23 03:15:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2022-11-23 03:15:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4531. [2022-11-23 03:15:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3571 states have (on average 1.8359003080369645) internal successors, (6556), 4496 states have internal predecessors, (6556), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 03:15:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6626 transitions. [2022-11-23 03:15:34,325 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6626 transitions. Word has length 57 [2022-11-23 03:15:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:34,325 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 6626 transitions. [2022-11-23 03:15:34,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6626 transitions. [2022-11-23 03:15:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 03:15:34,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:34,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:34,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (23)] Ended with exit code 0 [2022-11-23 03:15:34,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:34,540 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-11-23 03:15:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:34,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554816508] [2022-11-23 03:15:34,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:34,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:15:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:34,543 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:34,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:34,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:15:34,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:15:35,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:35,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:35,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554816508] [2022-11-23 03:15:35,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554816508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:35,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:35,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:15:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891044383] [2022-11-23 03:15:35,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:35,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:15:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:15:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:15:35,286 INFO L87 Difference]: Start difference. First operand 4531 states and 6626 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:35,514 INFO L93 Difference]: Finished difference Result 6332 states and 8900 transitions. [2022-11-23 03:15:35,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:15:35,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-23 03:15:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:35,525 INFO L225 Difference]: With dead ends: 6332 [2022-11-23 03:15:35,525 INFO L226 Difference]: Without dead ends: 6332 [2022-11-23 03:15:35,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:15:35,527 INFO L413 NwaCegarLoop]: 2340 mSDtfsCounter, 1264 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 4405 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:35,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 4405 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:15:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2022-11-23 03:15:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 5603. [2022-11-23 03:15:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5603 states, 4635 states have (on average 1.8101402373247033) internal successors, (8390), 5557 states have internal predecessors, (8390), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-23 03:15:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 8482 transitions. [2022-11-23 03:15:35,606 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 8482 transitions. Word has length 59 [2022-11-23 03:15:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:35,606 INFO L495 AbstractCegarLoop]: Abstraction has 5603 states and 8482 transitions. [2022-11-23 03:15:35,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 8482 transitions. [2022-11-23 03:15:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 03:15:35,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:35,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:35,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:35,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:35,822 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-23 03:15:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:35,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117856108] [2022-11-23 03:15:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:35,823 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:15:35,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:35,825 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:35,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Waiting until timeout for monitored process [2022-11-23 03:15:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:36,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:15:36,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:36,273 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:15:36,279 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:15:36,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:15:36,791 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:15:36,811 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:15:36,811 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:15:36,825 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:15:36,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:36,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:36,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117856108] [2022-11-23 03:15:36,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117856108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:36,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:36,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:15:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473329542] [2022-11-23 03:15:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:36,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:15:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:15:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:36,827 INFO L87 Difference]: Start difference. First operand 5603 states and 8482 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:43,708 INFO L93 Difference]: Finished difference Result 8022 states and 12205 transitions. [2022-11-23 03:15:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:15:43,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-23 03:15:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:43,718 INFO L225 Difference]: With dead ends: 8022 [2022-11-23 03:15:43,718 INFO L226 Difference]: Without dead ends: 8022 [2022-11-23 03:15:43,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:15:43,719 INFO L413 NwaCegarLoop]: 1035 mSDtfsCounter, 4063 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4077 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:43,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4077 Valid, 1639 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-23 03:15:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2022-11-23 03:15:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 5363. [2022-11-23 03:15:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 4479 states have (on average 1.7434695244474212) internal successors, (7809), 5317 states have internal predecessors, (7809), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-23 03:15:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 7901 transitions. [2022-11-23 03:15:43,805 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 7901 transitions. Word has length 62 [2022-11-23 03:15:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:43,805 INFO L495 AbstractCegarLoop]: Abstraction has 5363 states and 7901 transitions. [2022-11-23 03:15:43,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 7901 transitions. [2022-11-23 03:15:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 03:15:43,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:43,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:43,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:15:44,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:44,022 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-23 03:15:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:44,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110529606] [2022-11-23 03:15:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:44,023 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:15:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:44,024 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:44,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:44,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:15:44,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:44,411 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:15:44,425 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:15:44,467 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:15:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:15:44,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:44,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:44,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110529606] [2022-11-23 03:15:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110529606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:44,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:44,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:15:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223582962] [2022-11-23 03:15:44,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:44,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:15:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:15:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:44,481 INFO L87 Difference]: Start difference. First operand 5363 states and 7901 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:15:50,894 INFO L93 Difference]: Finished difference Result 5362 states and 7898 transitions. [2022-11-23 03:15:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:15:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-23 03:15:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:15:50,900 INFO L225 Difference]: With dead ends: 5362 [2022-11-23 03:15:50,900 INFO L226 Difference]: Without dead ends: 5362 [2022-11-23 03:15:50,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:15:50,901 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 4 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5554 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:15:50,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5554 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-23 03:15:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-23 03:15:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 5362. [2022-11-23 03:15:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5362 states, 4479 states have (on average 1.7427997320830542) internal successors, (7806), 5316 states have internal predecessors, (7806), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-23 03:15:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7898 transitions. [2022-11-23 03:15:50,951 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7898 transitions. Word has length 67 [2022-11-23 03:15:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:15:50,952 INFO L495 AbstractCegarLoop]: Abstraction has 5362 states and 7898 transitions. [2022-11-23 03:15:50,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:15:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7898 transitions. [2022-11-23 03:15:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 03:15:50,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:15:50,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:15:50,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:51,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:51,158 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:15:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:15:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-23 03:15:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:15:51,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952803276] [2022-11-23 03:15:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:15:51,160 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:15:51,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:15:51,161 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:15:51,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Waiting until timeout for monitored process [2022-11-23 03:15:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:15:51,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 03:15:51,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:15:51,653 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:15:51,676 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:15:51,688 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:15:51,743 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:15:51,751 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:15:51,770 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:15:51,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:15:51,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:15:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952803276] [2022-11-23 03:15:51,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952803276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:15:51,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:15:51,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:15:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289703054] [2022-11-23 03:15:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:15:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:15:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:15:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:15:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:15:51,772 INFO L87 Difference]: Start difference. First operand 5362 states and 7898 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:16:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:00,451 INFO L93 Difference]: Finished difference Result 5361 states and 7895 transitions. [2022-11-23 03:16:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:16:00,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-23 03:16:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:00,459 INFO L225 Difference]: With dead ends: 5361 [2022-11-23 03:16:00,460 INFO L226 Difference]: Without dead ends: 5361 [2022-11-23 03:16:00,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:16:00,461 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 2 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:00,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5555 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-23 03:16:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5361 states. [2022-11-23 03:16:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5361 to 5361. [2022-11-23 03:16:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5361 states, 4476 states have (on average 1.7432975871313674) internal successors, (7803), 5315 states have internal predecessors, (7803), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-23 03:16:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 7895 transitions. [2022-11-23 03:16:00,527 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 7895 transitions. Word has length 67 [2022-11-23 03:16:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:00,527 INFO L495 AbstractCegarLoop]: Abstraction has 5361 states and 7895 transitions. [2022-11-23 03:16:00,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:16:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 7895 transitions. [2022-11-23 03:16:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 03:16:00,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:00,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:00,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:16:00,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:00,730 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-11-23 03:16:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:00,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991113121] [2022-11-23 03:16:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:16:00,731 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:16:00,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:00,732 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:00,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:16:01,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:16:01,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:01,227 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:16:01,243 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:16:01,279 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:16:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:16:01,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:16:01,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991113121] [2022-11-23 03:16:01,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991113121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:16:01,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:16:01,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:16:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129862509] [2022-11-23 03:16:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:16:01,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:16:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:16:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:16:01,295 INFO L87 Difference]: Start difference. First operand 5361 states and 7895 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:16:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:07,619 INFO L93 Difference]: Finished difference Result 5360 states and 7891 transitions. [2022-11-23 03:16:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:16:07,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-23 03:16:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:07,625 INFO L225 Difference]: With dead ends: 5360 [2022-11-23 03:16:07,625 INFO L226 Difference]: Without dead ends: 5360 [2022-11-23 03:16:07,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:16:07,626 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 4 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5549 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:07,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5549 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-23 03:16:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5360 states. [2022-11-23 03:16:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5360 to 5360. [2022-11-23 03:16:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4476 states have (on average 1.7424039320822162) internal successors, (7799), 5314 states have internal predecessors, (7799), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-23 03:16:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 7891 transitions. [2022-11-23 03:16:07,678 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 7891 transitions. Word has length 67 [2022-11-23 03:16:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:07,678 INFO L495 AbstractCegarLoop]: Abstraction has 5360 states and 7891 transitions. [2022-11-23 03:16:07,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:16:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 7891 transitions. [2022-11-23 03:16:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 03:16:07,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:07,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:07,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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)] Ended with exit code 0 [2022-11-23 03:16:07,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:07,894 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-11-23 03:16:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593219851] [2022-11-23 03:16:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:16:07,895 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:16:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:07,896 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:07,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (29)] Waiting until timeout for monitored process [2022-11-23 03:16:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:16:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 03:16:08,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:08,351 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:16:08,383 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:16:08,395 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:16:08,450 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:16:08,457 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:16:08,475 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:16:08,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:16:08,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:08,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593219851] [2022-11-23 03:16:08,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593219851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:16:08,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:16:08,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:16:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032056317] [2022-11-23 03:16:08,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:16:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:16:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:16:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:16:08,477 INFO L87 Difference]: Start difference. First operand 5360 states and 7891 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:16:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:17,356 INFO L93 Difference]: Finished difference Result 5359 states and 7887 transitions. [2022-11-23 03:16:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:16:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-23 03:16:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:17,364 INFO L225 Difference]: With dead ends: 5359 [2022-11-23 03:16:17,364 INFO L226 Difference]: Without dead ends: 5359 [2022-11-23 03:16:17,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:16:17,365 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 2 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:17,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5550 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-23 03:16:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2022-11-23 03:16:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 5359. [2022-11-23 03:16:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5359 states, 4472 states have (on average 1.743067978533095) internal successors, (7795), 5313 states have internal predecessors, (7795), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-23 03:16:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 7887 transitions. [2022-11-23 03:16:17,421 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 7887 transitions. Word has length 67 [2022-11-23 03:16:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:17,422 INFO L495 AbstractCegarLoop]: Abstraction has 5359 states and 7887 transitions. [2022-11-23 03:16:17,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:16:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 7887 transitions. [2022-11-23 03:16:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 03:16:17,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:17,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:17,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (29)] Ended with exit code 0 [2022-11-23 03:16:17,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:17,639 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1457804367, now seen corresponding path program 1 times [2022-11-23 03:16:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509502329] [2022-11-23 03:16:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:16:17,640 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:16:17,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:17,641 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:17,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (30)] Waiting until timeout for monitored process [2022-11-23 03:16:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:16:18,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:16:18,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:18,138 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:16:18,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:16:18,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:18,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509502329] [2022-11-23 03:16:18,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509502329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:16:18,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:16:18,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:16:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966105439] [2022-11-23 03:16:18,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:16:18,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:16:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:16:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:16:18,142 INFO L87 Difference]: Start difference. First operand 5359 states and 7887 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:16:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:18,246 INFO L93 Difference]: Finished difference Result 5362 states and 7896 transitions. [2022-11-23 03:16:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:16:18,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-11-23 03:16:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:18,266 INFO L225 Difference]: With dead ends: 5362 [2022-11-23 03:16:18,266 INFO L226 Difference]: Without dead ends: 5362 [2022-11-23 03:16:18,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:16:18,272 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 2 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6307 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:18,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6307 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:16:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-23 03:16:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 5362. [2022-11-23 03:16:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5362 states, 4474 states have (on average 1.7429593205185516) internal successors, (7798), 5316 states have internal predecessors, (7798), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:16:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7896 transitions. [2022-11-23 03:16:18,354 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7896 transitions. Word has length 75 [2022-11-23 03:16:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:18,355 INFO L495 AbstractCegarLoop]: Abstraction has 5362 states and 7896 transitions. [2022-11-23 03:16:18,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:16:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7896 transitions. [2022-11-23 03:16:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-23 03:16:18,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:18,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:18,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (30)] Forceful destruction successful, exit code 0 [2022-11-23 03:16:18,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:18,571 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1162843208, now seen corresponding path program 1 times [2022-11-23 03:16:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:18,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904190735] [2022-11-23 03:16:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:16:18,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:16:18,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:18,574 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:18,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (31)] Waiting until timeout for monitored process [2022-11-23 03:16:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:16:18,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:16:18,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:19,016 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:16:19,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:16:19,135 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:16:19,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904190735] [2022-11-23 03:16:19,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904190735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:16:19,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:16:19,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-23 03:16:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61356025] [2022-11-23 03:16:19,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:16:19,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:16:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:16:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:16:19,137 INFO L87 Difference]: Start difference. First operand 5362 states and 7896 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:16:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:19,467 INFO L93 Difference]: Finished difference Result 5374 states and 7918 transitions. [2022-11-23 03:16:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:16:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-23 03:16:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:19,480 INFO L225 Difference]: With dead ends: 5374 [2022-11-23 03:16:19,481 INFO L226 Difference]: Without dead ends: 5374 [2022-11-23 03:16:19,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 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:16:19,481 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 23 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6309 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:19,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6309 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:16:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2022-11-23 03:16:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 5372. [2022-11-23 03:16:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 4483 states have (on average 1.7428061565915682) internal successors, (7813), 5325 states have internal predecessors, (7813), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:16:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 7911 transitions. [2022-11-23 03:16:19,555 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 7911 transitions. Word has length 76 [2022-11-23 03:16:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:19,555 INFO L495 AbstractCegarLoop]: Abstraction has 5372 states and 7911 transitions. [2022-11-23 03:16:19,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:16:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 7911 transitions. [2022-11-23 03:16:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-23 03:16:19,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:19,556 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:19,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (31)] Forceful destruction successful, exit code 0 [2022-11-23 03:16:19,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:19,771 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 934349455, now seen corresponding path program 2 times [2022-11-23 03:16:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:19,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961695146] [2022-11-23 03:16:19,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:16:19,773 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:16:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:19,774 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:19,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (32)] Waiting until timeout for monitored process [2022-11-23 03:16:20,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:16:20,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:16:20,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:16:20,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:20,589 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:16:20,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:16:20,876 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:16:20,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:20,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961695146] [2022-11-23 03:16:20,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961695146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:16:20,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:16:20,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-23 03:16:20,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271301280] [2022-11-23 03:16:20,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:16:20,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:16:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:16:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:16:20,879 INFO L87 Difference]: Start difference. First operand 5372 states and 7911 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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:16:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:21,985 INFO L93 Difference]: Finished difference Result 5393 states and 7959 transitions. [2022-11-23 03:16:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 03:16:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2022-11-23 03:16:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:21,998 INFO L225 Difference]: With dead ends: 5393 [2022-11-23 03:16:21,998 INFO L226 Difference]: Without dead ends: 5389 [2022-11-23 03:16:21,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-23 03:16:21,999 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 57 mSDsluCounter, 12613 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14721 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:22,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14721 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:16:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5389 states. [2022-11-23 03:16:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5389 to 5381. [2022-11-23 03:16:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5381 states, 4492 states have (on average 1.7419857524487978) internal successors, (7825), 5334 states have internal predecessors, (7825), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:16:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 7923 transitions. [2022-11-23 03:16:22,075 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 7923 transitions. Word has length 79 [2022-11-23 03:16:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:22,075 INFO L495 AbstractCegarLoop]: Abstraction has 5381 states and 7923 transitions. [2022-11-23 03:16:22,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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:16:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 7923 transitions. [2022-11-23 03:16:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-23 03:16:22,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:22,077 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:22,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (32)] Forceful destruction successful, exit code 0 [2022-11-23 03:16:22,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:22,290 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 71270383, now seen corresponding path program 3 times [2022-11-23 03:16:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:22,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918393084] [2022-11-23 03:16:22,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:16:22,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:16:22,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:22,293 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:22,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (33)] Waiting until timeout for monitored process [2022-11-23 03:16:23,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 03:16:23,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:16:23,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 03:16:23,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:23,444 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:16:23,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:16:24,468 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:16:24,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918393084] [2022-11-23 03:16:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918393084] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:16:24,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:16:24,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-23 03:16:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170467825] [2022-11-23 03:16:24,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:16:24,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 03:16:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 03:16:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-23 03:16:24,471 INFO L87 Difference]: Start difference. First operand 5381 states and 7923 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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:16:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:29,476 INFO L93 Difference]: Finished difference Result 5423 states and 8060 transitions. [2022-11-23 03:16:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 03:16:29,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2022-11-23 03:16:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:29,489 INFO L225 Difference]: With dead ends: 5423 [2022-11-23 03:16:29,489 INFO L226 Difference]: Without dead ends: 5417 [2022-11-23 03:16:29,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 03:16:29,491 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 159 mSDsluCounter, 27365 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 29477 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:29,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 29477 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 03:16:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2022-11-23 03:16:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 5399. [2022-11-23 03:16:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 4510 states have (on average 1.7401330376940134) internal successors, (7848), 5352 states have internal predecessors, (7848), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:16:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 7946 transitions. [2022-11-23 03:16:29,557 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 7946 transitions. Word has length 85 [2022-11-23 03:16:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:29,557 INFO L495 AbstractCegarLoop]: Abstraction has 5399 states and 7946 transitions. [2022-11-23 03:16:29,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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:16:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 7946 transitions. [2022-11-23 03:16:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-23 03:16:29,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:29,558 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:29,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (33)] Forceful destruction successful, exit code 0 [2022-11-23 03:16:29,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:29,759 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2019676847, now seen corresponding path program 4 times [2022-11-23 03:16:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:29,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919263673] [2022-11-23 03:16:29,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:16:29,760 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:16:29,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:29,761 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:29,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (34)] Waiting until timeout for monitored process [2022-11-23 03:16:30,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:16:30,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:16:30,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 03:16:30,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:30,816 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:16:30,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:16:33,360 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:16:33,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:33,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919263673] [2022-11-23 03:16:33,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919263673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:16:33,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:16:33,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-23 03:16:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988022677] [2022-11-23 03:16:33,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:16:33,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 03:16:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:16:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 03:16:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 03:16:33,364 INFO L87 Difference]: Start difference. First operand 5399 states and 7946 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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:16:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:16:47,891 INFO L93 Difference]: Finished difference Result 5479 states and 8163 transitions. [2022-11-23 03:16:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-23 03:16:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2022-11-23 03:16:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:16:47,903 INFO L225 Difference]: With dead ends: 5479 [2022-11-23 03:16:47,903 INFO L226 Difference]: Without dead ends: 5475 [2022-11-23 03:16:47,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-23 03:16:47,907 INFO L413 NwaCegarLoop]: 2125 mSDtfsCounter, 483 mSDsluCounter, 50861 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 52986 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:16:47,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 52986 Invalid, 3446 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [397 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-23 03:16:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2022-11-23 03:16:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5433. [2022-11-23 03:16:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5433 states, 4544 states have (on average 1.7372359154929577) internal successors, (7894), 5386 states have internal predecessors, (7894), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:16:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 7992 transitions. [2022-11-23 03:16:47,979 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 7992 transitions. Word has length 97 [2022-11-23 03:16:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:16:47,980 INFO L495 AbstractCegarLoop]: Abstraction has 5433 states and 7992 transitions. [2022-11-23 03:16:47,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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:16:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 7992 transitions. [2022-11-23 03:16:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-23 03:16:47,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:16:47,983 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:16:48,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (34)] Forceful destruction successful, exit code 0 [2022-11-23 03:16:48,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:48,199 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:16:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:16:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -366589681, now seen corresponding path program 5 times [2022-11-23 03:16:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:16:48,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050622094] [2022-11-23 03:16:48,200 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:16:48,200 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:16:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:16:48,201 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:16:48,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (35)] Waiting until timeout for monitored process [2022-11-23 03:16:49,795 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-23 03:16:49,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:16:49,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 03:16:49,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:16:49,848 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:16:50,013 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:16:50,013 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:16:50,047 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:16:50,154 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:16:51,013 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2642)))) is different from true [2022-11-23 03:16:51,332 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2651) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:16:51,737 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2658 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2658)))) is different from true [2022-11-23 03:16:51,832 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2661 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2661) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:16:52,075 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:16:52,076 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:16:52,129 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:16:52,170 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:16:52,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:16:52,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:16:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050622094] [2022-11-23 03:16:52,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050622094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:16:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [614301405] [2022-11-23 03:16:52,664 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:16:52,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:16:52,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:16:52,666 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:16:52,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-23 03:17:58,033 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-23 03:17:58,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:17:58,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-23 03:17:58,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:17:58,238 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:17:58,389 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:17:58,389 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:17:58,406 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:17:58,476 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:17:58,974 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098)))) is different from true [2022-11-23 03:17:59,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:17:59,499 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114)))) is different from true [2022-11-23 03:18:00,085 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:18:00,085 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:18:00,136 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:18:00,145 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:18:00,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:18:00,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3175) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 03:18:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [614301405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:18:00,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:18:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2022-11-23 03:18:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953661356] [2022-11-23 03:18:00,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:18:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 03:18:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:18:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 03:18:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=101, Unknown=17, NotChecked=216, Total=380 [2022-11-23 03:18:00,454 INFO L87 Difference]: Start difference. First operand 5433 states and 7992 transitions. Second operand has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 16 states have internal predecessors, (89), 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:18:02,017 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2642))) (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2661 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2661) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2651) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2658 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2658))) (exists ((v_ArrVal_2623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2623)))) is different from true [2022-11-23 03:18:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:18:21,259 INFO L93 Difference]: Finished difference Result 7988 states and 12048 transitions. [2022-11-23 03:18:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:18:21,260 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 16 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-11-23 03:18:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:18:21,281 INFO L225 Difference]: With dead ends: 7988 [2022-11-23 03:18:21,281 INFO L226 Difference]: Without dead ends: 7984 [2022-11-23 03:18:21,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 143 SyntacticMatches, 83 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=67, Invalid=158, Unknown=21, NotChecked=306, Total=552 [2022-11-23 03:18:21,282 INFO L413 NwaCegarLoop]: 1366 mSDtfsCounter, 1590 mSDsluCounter, 5456 mSDsCounter, 0 mSdLazyCounter, 5174 mSolverCounterSat, 13 mSolverCounterUnsat, 1777 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 6822 SdHoareTripleChecker+Invalid, 27584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5174 IncrementalHoareTripleChecker+Invalid, 1777 IncrementalHoareTripleChecker+Unknown, 20620 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:18:21,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 6822 Invalid, 27584 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 5174 Invalid, 1777 Unknown, 20620 Unchecked, 20.4s Time] [2022-11-23 03:18:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7984 states. [2022-11-23 03:18:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7984 to 5481. [2022-11-23 03:18:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5481 states, 4592 states have (on average 1.7290940766550522) internal successors, (7940), 5433 states have internal predecessors, (7940), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:18:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 8038 transitions. [2022-11-23 03:18:21,391 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 8038 transitions. Word has length 119 [2022-11-23 03:18:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:18:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 5481 states and 8038 transitions. [2022-11-23 03:18:21,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 16 states have internal predecessors, (89), 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:18:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 8038 transitions. [2022-11-23 03:18:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-23 03:18:21,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:18:21,393 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:21,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-23 03:18:21,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (35)] Forceful destruction successful, exit code 0 [2022-11-23 03:18:21,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:18:21,818 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:18:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -366589680, now seen corresponding path program 1 times [2022-11-23 03:18:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:18:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458264871] [2022-11-23 03:18:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:21,820 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:18:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:18:21,822 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:18:21,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (37)] Waiting until timeout for monitored process [2022-11-23 03:18:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:22,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-23 03:18:22,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:18:22,867 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:18:23,006 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:18:23,007 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:18:23,017 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:18:23,042 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:18:23,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:18:23,189 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:18:23,195 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:18:23,348 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556)))) is different from true [2022-11-23 03:18:23,361 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557)))) is different from true [2022-11-23 03:18:23,373 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560)))) is different from true [2022-11-23 03:18:23,421 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563)))) is different from true [2022-11-23 03:18:23,435 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:18:23,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:18:23,460 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570)))) is different from true [2022-11-23 03:18:23,476 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571)))) is different from true [2022-11-23 03:18:23,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:18:23,500 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576))) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575)))) is different from true [2022-11-23 03:18:23,518 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:18:23,532 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:18:23,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:18:23,604 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-11-23 03:18:23,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:18:23,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587)))) is different from true [2022-11-23 03:18:23,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:18:23,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-11-23 03:18:23,679 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594)))) is different from true [2022-11-23 03:18:23,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595)))) is different from true [2022-11-23 03:18:23,712 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:18:23,727 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600)))) is different from true [2022-11-23 03:18:23,744 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:18:23,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603)))) is different from true [2022-11-23 03:18:23,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605))) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2022-11-23 03:18:23,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:18:23,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610)))) is different from true [2022-11-23 03:18:23,813 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612)))) is different from true [2022-11-23 03:18:23,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613))) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:18:23,837 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:18:23,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617)))) is different from true [2022-11-23 03:18:23,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3620) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3619)))) is different from true [2022-11-23 03:18:23,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-11-23 03:18:23,885 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623)))) is different from true [2022-11-23 03:18:23,903 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625)))) is different from true [2022-11-23 03:18:23,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627)))) is different from true [2022-11-23 03:18:23,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3630) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3629)))) is different from true [2022-11-23 03:18:23,943 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:18:23,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3633))) (exists ((v_ArrVal_3634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3634)))) is different from true [2022-11-23 03:18:23,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636)))) is different from true [2022-11-23 03:18:23,983 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637)))) is different from true [2022-11-23 03:18:24,024 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:18:24,024 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:18:24,033 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:18:24,079 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:18:24,087 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:18:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-11-23 03:18:24,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:18:25,177 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |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:18:25,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:18:25,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458264871] [2022-11-23 03:18:25,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458264871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:18:25,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [144970199] [2022-11-23 03:18:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:18:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:18:25,187 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:18:25,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-23 03:20:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:20:16,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 03:20:17,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:20:17,008 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:20:17,144 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:20:17,156 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:20:17,157 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:20:17,166 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:20:17,175 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:20:17,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 22 treesize of output 10 [2022-11-23 03:20:17,247 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:20:17,299 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:20:17,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4108) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4109) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:17,354 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112)))) is different from true [2022-11-23 03:20:17,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116)))) is different from true [2022-11-23 03:20:17,416 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:17,430 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2022-11-23 03:20:17,443 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:17,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:20:17,470 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127)))) is different from true [2022-11-23 03:20:17,519 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130)))) is different from true [2022-11-23 03:20:17,533 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132)))) is different from true [2022-11-23 03:20:17,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:20:17,560 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136)))) is different from true [2022-11-23 03:20:17,574 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:20:17,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141))) (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:20:17,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143)))) is different from true [2022-11-23 03:20:17,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145)))) is different from true [2022-11-23 03:20:17,629 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146)))) is different from true [2022-11-23 03:20:17,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:17,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151)))) is different from true [2022-11-23 03:20:17,666 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153)))) is different from true [2022-11-23 03:20:17,783 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161)))) is different from true [2022-11-23 03:20:17,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:20:17,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166)))) is different from true [2022-11-23 03:20:17,896 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:20:17,979 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176)))) is different from true [2022-11-23 03:20:18,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:20:18,133 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186)))) is different from true [2022-11-23 03:20:18,147 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189)))) is different from true [2022-11-23 03:20:18,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-11-23 03:20:18,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:18,225 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:20:18,226 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:20:18,236 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:20:18,282 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:20:18,290 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:20:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 899 not checked. [2022-11-23 03:20:18,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:20:19,223 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 03:20:19,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [144970199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:20:19,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:20:19,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 39] total 80 [2022-11-23 03:20:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094473718] [2022-11-23 03:20:19,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:20:19,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-23 03:20:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:20:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-23 03:20:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=156, Unknown=79, NotChecked=6734, Total=7140 [2022-11-23 03:20:19,232 INFO L87 Difference]: Start difference. First operand 5481 states and 8038 transitions. Second operand has 81 states, 79 states have (on average 2.0) internal successors, (158), 81 states have internal predecessors, (158), 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:20:20,648 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-23 03:20:20,674 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4108) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112))) (exists ((v_ArrVal_4109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556)))) is different from true [2022-11-23 03:20:20,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556)))) is different from true [2022-11-23 03:20:20,697 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2022-11-23 03:20:20,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137))) (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2022-11-23 03:20:20,842 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137))) (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2022-11-23 03:20:20,857 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137))) (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131))) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571))) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575))) (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143))) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2022-11-23 03:20:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:20:42,792 INFO L93 Difference]: Finished difference Result 7994 states and 12055 transitions. [2022-11-23 03:20:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 03:20:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 2.0) internal successors, (158), 81 states have internal predecessors, (158), 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 119 [2022-11-23 03:20:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:20:42,800 INFO L225 Difference]: With dead ends: 7994 [2022-11-23 03:20:42,800 INFO L226 Difference]: Without dead ends: 7994 [2022-11-23 03:20:42,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 143 SyntacticMatches, 21 SemanticMatches, 96 ConstructedPredicates, 81 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=223, Invalid=281, Unknown=92, NotChecked=8910, Total=9506 [2022-11-23 03:20:42,802 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 1586 mSDsluCounter, 5789 mSDsCounter, 0 mSdLazyCounter, 8541 mSolverCounterSat, 14 mSolverCounterUnsat, 646 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 7158 SdHoareTripleChecker+Invalid, 221542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 8541 IncrementalHoareTripleChecker+Invalid, 646 IncrementalHoareTripleChecker+Unknown, 212341 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:20:42,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 7158 Invalid, 221542 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 8541 Invalid, 646 Unknown, 212341 Unchecked, 22.5s Time] [2022-11-23 03:20:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7994 states. [2022-11-23 03:20:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7994 to 5480. [2022-11-23 03:20:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 4592 states have (on average 1.7284407665505226) internal successors, (7937), 5432 states have internal predecessors, (7937), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-23 03:20:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 8035 transitions. [2022-11-23 03:20:42,860 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 8035 transitions. Word has length 119 [2022-11-23 03:20:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:20:42,860 INFO L495 AbstractCegarLoop]: Abstraction has 5480 states and 8035 transitions. [2022-11-23 03:20:42,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 2.0) internal successors, (158), 81 states have internal predecessors, (158), 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:20:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 8035 transitions. [2022-11-23 03:20:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-23 03:20:42,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:20:42,861 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:20:42,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (37)] Forceful destruction successful, exit code 0 [2022-11-23 03:20:43,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-23 03:20:43,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt [2022-11-23 03:20:43,262 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:20:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:20:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1446350987, now seen corresponding path program 1 times [2022-11-23 03:20:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:20:43,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156545783] [2022-11-23 03:20:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:20:43,263 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:20:43,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:20:43,264 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:20:43,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (39)] Waiting until timeout for monitored process [2022-11-23 03:20:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:20:44,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 03:20:44,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:20:44,186 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:20:44,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:20:44,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:20:44,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:20:44,199 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:20:44,288 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:20:44,289 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:20:44,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-23 03:20:44,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-23 03:20:44,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:20:44,600 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:20:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-23 03:20:44,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:20:44,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:20:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156545783] [2022-11-23 03:20:44,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156545783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:20:44,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:20:44,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:20:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769474163] [2022-11-23 03:20:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:20:44,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:20:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:20:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:20:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:20:44,623 INFO L87 Difference]: Start difference. First operand 5480 states and 8035 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:20:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:20:55,528 INFO L93 Difference]: Finished difference Result 5661 states and 7966 transitions. [2022-11-23 03:20:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:20:55,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-11-23 03:20:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:20:55,535 INFO L225 Difference]: With dead ends: 5661 [2022-11-23 03:20:55,535 INFO L226 Difference]: Without dead ends: 5661 [2022-11-23 03:20:55,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:20:55,536 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 2055 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 4074 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 5668 SdHoareTripleChecker+Invalid, 4105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:20:55,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 5668 Invalid, 4105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4074 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-11-23 03:20:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2022-11-23 03:20:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5080. [2022-11-23 03:20:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4193 states have (on average 1.7522060577152396) internal successors, (7347), 5035 states have internal predecessors, (7347), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-23 03:20:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 7438 transitions. [2022-11-23 03:20:55,597 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 7438 transitions. Word has length 119 [2022-11-23 03:20:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:20:55,597 INFO L495 AbstractCegarLoop]: Abstraction has 5080 states and 7438 transitions. [2022-11-23 03:20:55,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:20:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 7438 transitions. [2022-11-23 03:20:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-23 03:20:55,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:20:55,599 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:20:55,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (39)] Forceful destruction successful, exit code 0 [2022-11-23 03:20:55,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:20:55,814 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:20:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:20:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969817, now seen corresponding path program 1 times [2022-11-23 03:20:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:20:55,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794410101] [2022-11-23 03:20:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:20:55,816 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:20:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:20:55,816 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:20:55,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (40)] Waiting until timeout for monitored process [2022-11-23 03:20:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:20:56,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-23 03:20:56,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:20:56,864 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:20:56,995 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:20:56,995 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:20:57,020 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:20:57,127 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:20:57,270 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043)))) is different from true [2022-11-23 03:20:57,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5044) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:57,562 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5052) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:57,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5055)))) is different from true [2022-11-23 03:20:57,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056)))) is different from true [2022-11-23 03:20:58,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5067)))) is different from true [2022-11-23 03:20:58,404 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5076)))) is different from true [2022-11-23 03:20:58,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5078) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:58,467 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5079)))) is different from true [2022-11-23 03:20:58,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5085 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5085) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:20:58,703 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:20:58,704 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:20:58,834 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:20:58,834 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:20:58,858 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:20:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 395 not checked. [2022-11-23 03:20:58,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:01,019 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 03:21:01,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5132))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 03:21:01,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794410101] [2022-11-23 03:21:01,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794410101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:21:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1835120108] [2022-11-23 03:21:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:01,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:21:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:21:01,340 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:21:01,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-23 03:21:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:05,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 03:21:05,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:05,790 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:05,968 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:21:05,968 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:21:05,986 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:21:06,059 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:21:06,270 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515)))) is different from true [2022-11-23 03:21:06,377 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:06,429 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520)))) is different from true [2022-11-23 03:21:06,710 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:06,778 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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)))) is different from true [2022-11-23 03:21:06,796 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531)))) is different from true [2022-11-23 03:21:06,956 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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:21:07,077 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540)))) is different from true [2022-11-23 03:21:07,133 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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)))) is different from true [2022-11-23 03:21:07,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543)))) is different from true [2022-11-23 03:21:07,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:07,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547)))) is different from true [2022-11-23 03:21:07,310 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549)))) is different from true [2022-11-23 03:21:07,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-23 03:21:07,575 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:21:07,575 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:21:07,667 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:21:07,667 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:21:07,693 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:21:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 525 not checked. [2022-11-23 03:21:07,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:07,723 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5556) |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:21:07,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 03:21:08,069 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5556 (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~mem39#1.base| v_ArrVal_5602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5556)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 03:21:08,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1835120108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:21:08,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:21:08,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 33 [2022-11-23 03:21:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142277145] [2022-11-23 03:21:08,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:21:08,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 03:21:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:08,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 03:21:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=141, Unknown=39, NotChecked=1450, Total=1722 [2022-11-23 03:21:08,074 INFO L87 Difference]: Start difference. First operand 5080 states and 7438 transitions. Second operand has 34 states, 32 states have (on average 3.78125) internal successors, (121), 34 states have internal predecessors, (121), 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:09,356 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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_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_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5078) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5055))) (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))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043))) (exists ((v_ArrVal_5085 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5085) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5076))) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (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|)) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042))) (exists ((v_ArrVal_5052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5052) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5067))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-23 03:21:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:21:30,518 INFO L93 Difference]: Finished difference Result 7536 states and 11389 transitions. [2022-11-23 03:21:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:21:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.78125) internal successors, (121), 34 states have internal predecessors, (121), 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 122 [2022-11-23 03:21:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:21:30,529 INFO L225 Difference]: With dead ends: 7536 [2022-11-23 03:21:30,529 INFO L226 Difference]: Without dead ends: 7536 [2022-11-23 03:21:30,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 150 SyntacticMatches, 68 SemanticMatches, 44 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=113, Invalid=204, Unknown=43, NotChecked=1710, Total=2070 [2022-11-23 03:21:30,530 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 1581 mSDsluCounter, 5481 mSDsCounter, 0 mSdLazyCounter, 5448 mSolverCounterSat, 13 mSolverCounterUnsat, 1713 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 6852 SdHoareTripleChecker+Invalid, 58183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5448 IncrementalHoareTripleChecker+Invalid, 1713 IncrementalHoareTripleChecker+Unknown, 51009 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:21:30,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 6852 Invalid, 58183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 5448 Invalid, 1713 Unknown, 51009 Unchecked, 22.0s Time] [2022-11-23 03:21:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2022-11-23 03:21:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 5079. [2022-11-23 03:21:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5079 states, 4193 states have (on average 1.7514905795373241) internal successors, (7344), 5034 states have internal predecessors, (7344), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-23 03:21:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 7435 transitions. [2022-11-23 03:21:30,598 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 7435 transitions. Word has length 122 [2022-11-23 03:21:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:21:30,598 INFO L495 AbstractCegarLoop]: Abstraction has 5079 states and 7435 transitions. [2022-11-23 03:21:30,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.78125) internal successors, (121), 34 states have internal predecessors, (121), 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:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 7435 transitions. [2022-11-23 03:21:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-23 03:21:30,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:21:30,600 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:30,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (40)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:30,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:31,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt [2022-11-23 03:21:31,018 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:21:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969818, now seen corresponding path program 1 times [2022-11-23 03:21:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:31,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029935307] [2022-11-23 03:21:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:31,019 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,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:31,020 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (42)] Waiting until timeout for monitored process [2022-11-23 03:21:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:32,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 03:21:32,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:32,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 03:21:32,291 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:21:32,291 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:32,299 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:21:32,324 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:21:32,336 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:32,451 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:21:32,457 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:21:32,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:32,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:21:32,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992)))) is different from true [2022-11-23 03:21:32,643 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:32,657 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997)))) is different from true [2022-11-23 03:21:32,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000)))) is different from true [2022-11-23 03:21:32,764 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-11-23 03:21:32,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010))) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:21:32,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013)))) is different from true [2022-11-23 03:21:32,881 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6015) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6014)))) is different from true [2022-11-23 03:21:32,895 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:32,909 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019))) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018)))) is different from true [2022-11-23 03:21:32,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:33,011 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024)))) is different from true [2022-11-23 03:21:33,026 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:33,041 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:33,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031)))) is different from true [2022-11-23 03:21:33,071 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032)))) is different from true [2022-11-23 03:21:33,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034)))) is different from true [2022-11-23 03:21:33,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037)))) is different from true [2022-11-23 03:21:33,115 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039)))) is different from true [2022-11-23 03:21:33,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:33,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042)))) is different from true [2022-11-23 03:21:33,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044)))) is different from true [2022-11-23 03:21:33,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6047))) (exists ((v_ArrVal_6046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6046) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:21:33,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6048)))) is different from true [2022-11-23 03:21:33,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051))) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:21:33,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052)))) is different from true [2022-11-23 03:21:33,230 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054)))) is different from true [2022-11-23 03:21:33,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056)))) is different from true [2022-11-23 03:21:33,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:21:33,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060)))) is different from true [2022-11-23 03:21:33,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2022-11-23 03:21:33,302 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065))) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:21:33,316 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067)))) is different from true [2022-11-23 03:21:33,331 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068)))) is different from true [2022-11-23 03:21:33,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071)))) is different from true [2022-11-23 03:21:33,403 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:21:33,403 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:21:33,410 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:21:33,553 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:21:33,553 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:21:33,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 03:21:33,595 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:21:33,603 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:21:33,641 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:21:33,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:21:33,862 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 03:21:33,907 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 03:21:34,915 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) .cse0 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-23 03:21:34,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:34,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029935307] [2022-11-23 03:21:34,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029935307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:21:34,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [429203148] [2022-11-23 03:21:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:21:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:21:34,931 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:21:34,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-23 03:23:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:29,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 03:23:29,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:23:29,541 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:29,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 5 [2022-11-23 03:23:29,713 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:23:29,713 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:29,729 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:29,741 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:29,835 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:29,855 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:29,933 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:23:29,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6550) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6549)))) is different from true [2022-11-23 03:23:29,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551))) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552)))) is different from true [2022-11-23 03:23:29,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:29,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555)))) is different from true [2022-11-23 03:23:30,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,039 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6563) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6564)))) is different from true [2022-11-23 03:23:30,068 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:23:30,082 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,095 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569))) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:23:30,108 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571)))) is different from true [2022-11-23 03:23:30,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573)))) is different from true [2022-11-23 03:23:30,132 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6576) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6575) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,157 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6579))) (exists ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6580)))) is different from true [2022-11-23 03:23:30,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581)))) is different from true [2022-11-23 03:23:30,182 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6583))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6584)))) is different from true [2022-11-23 03:23:30,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585)))) is different from true [2022-11-23 03:23:30,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6589))) (exists ((v_ArrVal_6590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6590) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,231 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6591))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6592) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595)))) is different from true [2022-11-23 03:23:30,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597)))) is different from true [2022-11-23 03:23:30,279 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600)))) is different from true [2022-11-23 03:23:30,291 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601)))) is different from true [2022-11-23 03:23:30,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603)))) is different from true [2022-11-23 03:23:30,316 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608)))) is different from true [2022-11-23 03:23:30,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:23:30,370 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611)))) is different from true [2022-11-23 03:23:30,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614)))) is different from true [2022-11-23 03:23:30,396 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616)))) is different from true [2022-11-23 03:23:30,409 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-23 03:23:30,422 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619)))) is different from true [2022-11-23 03:23:30,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6621) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6622) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,462 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623)))) is different from true [2022-11-23 03:23:30,517 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628)))) is different from true [2022-11-23 03:23:30,533 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6629))) (exists ((v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6630) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:30,548 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:30,615 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:23:30,616 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:30,623 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:30,714 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:23:30,715 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:30,721 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:30,761 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:30,769 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:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-23 03:23:30,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:23:30,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 03:23:30,880 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_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |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:23:31,927 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-23 03:23:31,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [429203148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:23:31,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:23:31,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 52] total 89 [2022-11-23 03:23:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314770158] [2022-11-23 03:23:31,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:23:31,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-23 03:23:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:23:31,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-23 03:23:31,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=184, Unknown=93, NotChecked=9030, Total=9506 [2022-11-23 03:23:31,939 INFO L87 Difference]: Start difference. First operand 5079 states and 7435 transitions. Second operand has 90 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 90 states have internal predecessors, (166), 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:23:33,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:23:56,961 INFO L93 Difference]: Finished difference Result 7534 states and 11384 transitions. [2022-11-23 03:23:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:23:56,962 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 90 states have internal predecessors, (166), 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 122 [2022-11-23 03:23:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:23:56,974 INFO L225 Difference]: With dead ends: 7534 [2022-11-23 03:23:56,975 INFO L226 Difference]: Without dead ends: 7534 [2022-11-23 03:23:56,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 150 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 87 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=246, Invalid=343, Unknown=101, NotChecked=10440, Total=11130 [2022-11-23 03:23:56,978 INFO L413 NwaCegarLoop]: 1368 mSDtfsCounter, 1586 mSDsluCounter, 4266 mSDsCounter, 0 mSdLazyCounter, 7436 mSolverCounterSat, 15 mSolverCounterUnsat, 924 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 178050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7436 IncrementalHoareTripleChecker+Invalid, 924 IncrementalHoareTripleChecker+Unknown, 169675 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:23:56,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 5634 Invalid, 178050 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 7436 Invalid, 924 Unknown, 169675 Unchecked, 24.1s Time] [2022-11-23 03:23:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2022-11-23 03:23:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 5078. [2022-11-23 03:23:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 4193 states have (on average 1.7507751013594086) internal successors, (7341), 5033 states have internal predecessors, (7341), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-23 03:23:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 7432 transitions. [2022-11-23 03:23:57,068 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 7432 transitions. Word has length 122 [2022-11-23 03:23:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:23:57,069 INFO L495 AbstractCegarLoop]: Abstraction has 5078 states and 7432 transitions. [2022-11-23 03:23:57,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 90 states have internal predecessors, (166), 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:23:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 7432 transitions. [2022-11-23 03:23:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-23 03:23:57,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:23:57,071 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:57,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (42)] Forceful destruction successful, exit code 0 [2022-11-23 03:23:57,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-23 03:23:57,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt [2022-11-23 03:23:57,488 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-23 03:23:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash 858556407, now seen corresponding path program 1 times [2022-11-23 03:23:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:23:57,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539446160] [2022-11-23 03:23:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:57,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:23:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:23:57,491 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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:57,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/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 (44)] Waiting until timeout for monitored process [2022-11-23 03:23:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:58,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-23 03:23:58,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:23:58,742 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:58,877 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:58,893 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:23:58,894 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:58,916 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:58,926 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:59,050 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:59,055 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:59,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125)))) is different from true [2022-11-23 03:23:59,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7127))) (exists ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7128))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32)))) is different from true [2022-11-23 03:23:59,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130)))) is different from true [2022-11-23 03:23:59,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7133)))) is different from true [2022-11-23 03:23:59,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135)))) is different from true [2022-11-23 03:23:59,234 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138)))) is different from true [2022-11-23 03:23:59,250 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:59,265 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141)))) is different from true [2022-11-23 03:23:59,281 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:59,296 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146)))) is different from true [2022-11-23 03:23:59,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150)))) is different from true [2022-11-23 03:23:59,389 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:59,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:59,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155)))) is different from true [2022-11-23 03:23:59,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:23:59,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159)))) is different from true [2022-11-23 03:23:59,535 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:59,586 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:59,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172)))) is different from true [2022-11-23 03:23:59,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7175)))) is different from true [2022-11-23 03:23:59,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178)))) is different from true [2022-11-23 03:23:59,688 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180)))) is different from true [2022-11-23 03:23:59,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182)))) is different from true [2022-11-23 03:23:59,793 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:23:59,882 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194)))) is different from true [2022-11-23 03:23:59,935 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198)))) is different from true [2022-11-23 03:24:00,025 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7203))) (exists ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7204)))) is different from true [2022-11-23 03:24:00,040 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 03:24:00,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207)))) is different from true [2022-11-23 03:24:00,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 03:24:00,173 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:24:00,174 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:24:00,189 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:24:00,319 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:24:00,319 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:24:00,333 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:24:00,440 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:24:00,441 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:24:00,448 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:24:00,485 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:24:00,492 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:24:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2022-11-23 03:24:00,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:24:00,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-23 03:24:00,773 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 03:24:01,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) .cse2 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-23 03:24:03,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307) .cse1 v_ArrVal_7214) (select (select (store .cse2 .cse1 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7215))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7213))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307) .cse4 v_ArrVal_7214) .cse5 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-23 03:24:03,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:24:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539446160] [2022-11-23 03:24:03,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539446160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:24:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768381793] [2022-11-23 03:24:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 03:24:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 03:24:03,823 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 03:24:03,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c934515-6c1f-466e-b981-de2fe6f25615/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process