./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- 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-38b53e6 [2022-11-25 23:41:15,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:41:15,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:41:15,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:41:15,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:41:15,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:41:15,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:41:15,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:41:15,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:41:15,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:41:15,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:41:15,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:41:15,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:41:15,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:41:15,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:41:15,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:41:15,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:41:15,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:41:15,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:41:15,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:41:15,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:41:15,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:41:15,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:41:15,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:41:15,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:41:15,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:41:15,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:41:15,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:41:15,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:41:15,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:41:15,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:41:15,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:41:15,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:41:15,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:41:15,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:41:15,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:41:15,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:41:15,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:41:15,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:41:15,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:41:15,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:41:15,141 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:41:15,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:41:15,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:41:15,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:41:15,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:41:15,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:41:15,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:41:15,175 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:41:15,175 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:41:15,175 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:41:15,176 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:41:15,176 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:41:15,176 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:41:15,177 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:41:15,177 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:41:15,177 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:41:15,178 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:41:15,178 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:41:15,178 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:41:15,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:41:15,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:41:15,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:41:15,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:41:15,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:41:15,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:41:15,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:41:15,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:41:15,182 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:41:15,182 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:41:15,183 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:41:15,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:41:15,183 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:41:15,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:41:15,184 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:41:15,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:41:15,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:41:15,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:41:15,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:41:15,186 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:41:15,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:41:15,186 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:41:15,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:41:15,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:41:15,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/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_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2022-11-25 23:41:15,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:41:15,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:41:15,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:41:15,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:41:15,556 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:41:15,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-25 23:41:18,895 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:41:19,231 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:41:19,232 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-25 23:41:19,259 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data/103b43861/48199650bb4e46b2b837cbd2cc01dfb5/FLAGa81ed01b7 [2022-11-25 23:41:19,285 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data/103b43861/48199650bb4e46b2b837cbd2cc01dfb5 [2022-11-25 23:41:19,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:41:19,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:41:19,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:41:19,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:41:19,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:41:19,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:41:19" (1/1) ... [2022-11-25 23:41:19,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@185268da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:19, skipping insertion in model container [2022-11-25 23:41:19,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:41:19" (1/1) ... [2022-11-25 23:41:19,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:41:19,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:41:19,857 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_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-25 23:41:19,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:41:19,993 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-25 23:41:19,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@82cb768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:19, skipping insertion in model container [2022-11-25 23:41:19,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:41:19,995 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 23:41:19,997 INFO L158 Benchmark]: Toolchain (without parser) took 706.32ms. Allocated memory is still 169.9MB. Free memory was 127.8MB in the beginning and 111.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:41:19,998 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory was 75.6MB in the beginning and 75.5MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:41:19,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.13ms. Allocated memory is still 169.9MB. Free memory was 127.2MB in the beginning and 111.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 23:41:20,000 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.28ms. Allocated memory is still 134.2MB. Free memory was 75.6MB in the beginning and 75.5MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.13ms. Allocated memory is still 169.9MB. Free memory was 127.2MB in the beginning and 111.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- 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-38b53e6 [2022-11-25 23:41:22,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:41:22,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:41:22,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:41:22,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:41:22,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:41:22,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:41:22,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:41:22,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:41:22,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:41:22,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:41:22,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:41:22,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:41:22,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:41:22,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:41:22,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:41:22,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:41:22,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:41:22,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:41:22,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:41:22,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:41:22,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:41:22,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:41:22,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:41:22,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:41:22,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:41:22,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:41:22,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:41:22,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:41:22,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:41:22,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:41:22,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:41:22,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:41:22,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:41:22,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:41:22,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:41:22,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:41:22,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:41:22,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:41:22,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:41:22,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:41:22,607 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 23:41:22,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:41:22,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:41:22,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:41:22,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:41:22,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:41:22,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:41:22,662 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:41:22,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:41:22,662 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:41:22,662 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:41:22,664 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:41:22,664 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:41:22,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:41:22,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:41:22,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:41:22,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:41:22,666 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:41:22,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:41:22,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:41:22,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:41:22,667 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:41:22,667 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:41:22,667 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:41:22,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:41:22,668 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:41:22,668 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:41:22,668 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:41:22,668 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:41:22,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:41:22,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:41:22,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:41:22,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:41:22,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:41:22,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:41:22,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:41:22,670 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:41:22,671 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:41:22,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:41:22,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:41:22,671 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/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_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2022-11-25 23:41:23,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:41:23,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:41:23,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:41:23,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:41:23,164 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:41:23,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-25 23:41:26,671 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:41:27,046 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:41:27,047 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-25 23:41:27,067 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data/15e5e50be/94c6187818d94c6da98b458034e9c9a0/FLAG34be8ae5a [2022-11-25 23:41:27,094 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/data/15e5e50be/94c6187818d94c6da98b458034e9c9a0 [2022-11-25 23:41:27,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:41:27,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:41:27,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:41:27,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:41:27,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:41:27,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:41:27" (1/1) ... [2022-11-25 23:41:27,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2070d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:27, skipping insertion in model container [2022-11-25 23:41:27,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:41:27" (1/1) ... [2022-11-25 23:41:27,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:41:27,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:41:27,755 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_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-25 23:41:27,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:41:27,931 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 23:41:27,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:41:27,994 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_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-25 23:41:28,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:41:28,116 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:41:28,184 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_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-25 23:41:28,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:41:28,313 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:41:28,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28 WrapperNode [2022-11-25 23:41:28,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:41:28,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:41:28,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:41:28,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:41:28,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,412 INFO L138 Inliner]: procedures = 180, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 624 [2022-11-25 23:41:28,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:41:28,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:41:28,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:41:28,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:41:28,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,489 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:41:28,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:41:28,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:41:28,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:41:28,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (1/1) ... [2022-11-25 23:41:28,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:41:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:28,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:41:28,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:41:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 23:41:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 23:41:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 23:41:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 23:41:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 23:41:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 23:41:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:41:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:41:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:41:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:41:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:41:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:41:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 23:41:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:41:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:41:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:41:28,844 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:41:28,869 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:41:28,873 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 23:41:32,752 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:41:32,777 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:41:32,781 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-25 23:41:32,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:41:32 BoogieIcfgContainer [2022-11-25 23:41:32,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:41:32,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:41:32,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:41:32,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:41:32,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:41:27" (1/3) ... [2022-11-25 23:41:32,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db9447b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:41:32, skipping insertion in model container [2022-11-25 23:41:32,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:28" (2/3) ... [2022-11-25 23:41:32,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db9447b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:41:32, skipping insertion in model container [2022-11-25 23:41:32,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:41:32" (3/3) ... [2022-11-25 23:41:32,802 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2022-11-25 23:41:32,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:41:32,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2022-11-25 23:41:32,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:41:32,907 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66435f80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:41:32,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2022-11-25 23:41:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 667 states, 324 states have (on average 2.2314814814814814) internal successors, (723), 661 states have internal predecessors, (723), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:41:32,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:32,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:41:32,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-25 23:41:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:32,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440843203] [2022-11-25 23:41:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:32,956 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-25 23:41:32,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:32,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:32,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:33,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 23:41:33,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:33,156 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-25 23:41:33,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:33,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440843203] [2022-11-25 23:41:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440843203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:33,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:33,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:41:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172368922] [2022-11-25 23:41:33,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:33,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:41:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:41:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:41:33,229 INFO L87 Difference]: Start difference. First operand has 667 states, 324 states have (on average 2.2314814814814814) internal successors, (723), 661 states have internal predecessors, (723), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:33,295 INFO L93 Difference]: Finished difference Result 658 states and 704 transitions. [2022-11-25 23:41:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:41:33,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:41:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:33,316 INFO L225 Difference]: With dead ends: 658 [2022-11-25 23:41:33,316 INFO L226 Difference]: Without dead ends: 656 [2022-11-25 23:41:33,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:41:33,322 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:33,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:41:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-25 23:41:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-11-25 23:41:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 319 states have (on average 2.1191222570532915) internal successors, (676), 650 states have internal predecessors, (676), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 702 transitions. [2022-11-25 23:41:33,482 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 702 transitions. Word has length 5 [2022-11-25 23:41:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:33,483 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 702 transitions. [2022-11-25 23:41:33,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 702 transitions. [2022-11-25 23:41:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:41:33,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:33,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:41:33,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:33,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:33,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-25 23:41:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:33,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628699804] [2022-11-25 23:41:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:33,712 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-25 23:41:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:33,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:33,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:33,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:41:33,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:33,905 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-25 23:41:33,924 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-25 23:41:33,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:33,924 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:33,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628699804] [2022-11-25 23:41:33,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628699804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:33,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:33,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:41:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140519056] [2022-11-25 23:41:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:33,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:41:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:41:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:33,929 INFO L87 Difference]: Start difference. First operand 656 states and 702 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:35,800 INFO L93 Difference]: Finished difference Result 614 states and 661 transitions. [2022-11-25 23:41:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:41:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:41:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:35,807 INFO L225 Difference]: With dead ends: 614 [2022-11-25 23:41:35,808 INFO L226 Difference]: Without dead ends: 614 [2022-11-25 23:41:35,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:35,810 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 594 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:35,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 349 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 23:41:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-25 23:41:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 607. [2022-11-25 23:41:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 319 states have (on average 1.9655172413793103) internal successors, (627), 601 states have internal predecessors, (627), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 653 transitions. [2022-11-25 23:41:35,880 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 653 transitions. Word has length 5 [2022-11-25 23:41:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:35,880 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 653 transitions. [2022-11-25 23:41:35,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 653 transitions. [2022-11-25 23:41:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:41:35,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:35,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:41:35,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:36,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:36,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-25 23:41:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:36,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159967043] [2022-11-25 23:41:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:36,086 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-25 23:41:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:36,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:36,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:36,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:41:36,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:36,235 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-25 23:41:36,260 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-25 23:41:36,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:36,260 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159967043] [2022-11-25 23:41:36,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159967043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:36,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:36,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:41:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97821722] [2022-11-25 23:41:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:36,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:41:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:41:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:36,263 INFO L87 Difference]: Start difference. First operand 607 states and 653 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:38,617 INFO L93 Difference]: Finished difference Result 674 states and 724 transitions. [2022-11-25 23:41:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:41:38,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:41:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:38,625 INFO L225 Difference]: With dead ends: 674 [2022-11-25 23:41:38,625 INFO L226 Difference]: Without dead ends: 674 [2022-11-25 23:41:38,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:38,627 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 254 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:38,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 748 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-25 23:41:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-25 23:41:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 629. [2022-11-25 23:41:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 351 states have (on average 1.9458689458689458) internal successors, (683), 623 states have internal predecessors, (683), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 709 transitions. [2022-11-25 23:41:38,655 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 709 transitions. Word has length 5 [2022-11-25 23:41:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:38,655 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 709 transitions. [2022-11-25 23:41:38,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 709 transitions. [2022-11-25 23:41:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:41:38,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:38,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:41:38,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:38,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:38,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1156729148, now seen corresponding path program 1 times [2022-11-25 23:41:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:38,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144248885] [2022-11-25 23:41:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:41:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:38,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:38,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:38,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:41:38,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:38,976 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-25 23:41:38,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:38,976 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:38,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144248885] [2022-11-25 23:41:38,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144248885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:38,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:38,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96839751] [2022-11-25 23:41:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:38,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:41:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:38,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:41:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:38,980 INFO L87 Difference]: Start difference. First operand 629 states and 709 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:39,089 INFO L93 Difference]: Finished difference Result 1209 states and 1349 transitions. [2022-11-25 23:41:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:41:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:41:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:39,099 INFO L225 Difference]: With dead ends: 1209 [2022-11-25 23:41:39,099 INFO L226 Difference]: Without dead ends: 1209 [2022-11-25 23:41:39,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:39,101 INFO L413 NwaCegarLoop]: 862 mSDtfsCounter, 567 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:39,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1499 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:41:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-11-25 23:41:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 630. [2022-11-25 23:41:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 352 states have (on average 1.9431818181818181) internal successors, (684), 624 states have internal predecessors, (684), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 710 transitions. [2022-11-25 23:41:39,128 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 710 transitions. Word has length 6 [2022-11-25 23:41:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:39,130 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 710 transitions. [2022-11-25 23:41:39,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 710 transitions. [2022-11-25 23:41:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:41:39,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:39,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:39,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:39,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:39,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-25 23:41:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:39,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141829962] [2022-11-25 23:41:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:39,354 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-25 23:41:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:39,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:39,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:39,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:41:39,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:39,551 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-25 23:41:39,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:39,552 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:39,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141829962] [2022-11-25 23:41:39,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141829962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:39,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:39,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510467682] [2022-11-25 23:41:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:39,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:41:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:39,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:41:39,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:39,555 INFO L87 Difference]: Start difference. First operand 630 states and 710 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-25 23:41:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:39,600 INFO L93 Difference]: Finished difference Result 594 states and 673 transitions. [2022-11-25 23:41:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:41:39,601 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-25 23:41:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:39,604 INFO L225 Difference]: With dead ends: 594 [2022-11-25 23:41:39,605 INFO L226 Difference]: Without dead ends: 594 [2022-11-25 23:41:39,605 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-25 23:41:39,606 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 561 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 625 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-25 23:41:39,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 625 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:41:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-25 23:41:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 588. [2022-11-25 23:41:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 334 states have (on average 1.9191616766467066) internal successors, (641), 582 states have internal predecessors, (641), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 667 transitions. [2022-11-25 23:41:39,625 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 667 transitions. Word has length 11 [2022-11-25 23:41:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:39,625 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 667 transitions. [2022-11-25 23:41:39,626 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-25 23:41:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 667 transitions. [2022-11-25 23:41:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:41:39,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:39,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:39,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:39,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-25 23:41:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:39,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135267607] [2022-11-25 23:41:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:39,843 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-25 23:41:39,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:39,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:39,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:39,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:41:39,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:40,022 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-25 23:41:40,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:40,023 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135267607] [2022-11-25 23:41:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135267607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:40,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:40,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:41:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124644391] [2022-11-25 23:41:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:40,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:41:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:41:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:40,026 INFO L87 Difference]: Start difference. First operand 588 states and 667 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-25 23:41:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:40,128 INFO L93 Difference]: Finished difference Result 573 states and 645 transitions. [2022-11-25 23:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:41:40,129 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-25 23:41:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:40,132 INFO L225 Difference]: With dead ends: 573 [2022-11-25 23:41:40,132 INFO L226 Difference]: Without dead ends: 573 [2022-11-25 23:41:40,132 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-25 23:41:40,133 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 542 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1123 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-25 23:41:40,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:41:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-11-25 23:41:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 566. [2022-11-25 23:41:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 326 states have (on average 1.8773006134969326) internal successors, (612), 560 states have internal predecessors, (612), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 638 transitions. [2022-11-25 23:41:40,150 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 638 transitions. Word has length 13 [2022-11-25 23:41:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:40,150 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 638 transitions. [2022-11-25 23:41:40,151 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-25 23:41:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 638 transitions. [2022-11-25 23:41:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:41:40,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:40,152 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-25 23:41:40,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:40,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:40,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-25 23:41:40,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:40,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457756395] [2022-11-25 23:41:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:40,367 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-25 23:41:40,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:40,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:40,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:40,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:41:40,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:40,522 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-25 23:41:40,617 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-25 23:41:40,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:40,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457756395] [2022-11-25 23:41:40,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457756395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:40,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:40,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986537546] [2022-11-25 23:41:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:40,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:41:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:41:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:40,620 INFO L87 Difference]: Start difference. First operand 566 states and 638 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-25 23:41:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:42,399 INFO L93 Difference]: Finished difference Result 610 states and 703 transitions. [2022-11-25 23:41:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:41:42,400 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-25 23:41:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:42,403 INFO L225 Difference]: With dead ends: 610 [2022-11-25 23:41:42,403 INFO L226 Difference]: Without dead ends: 610 [2022-11-25 23:41:42,403 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-25 23:41:42,404 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 956 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:42,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 383 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 23:41:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-25 23:41:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 562. [2022-11-25 23:41:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 326 states have (on average 1.8650306748466257) internal successors, (608), 556 states have internal predecessors, (608), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 634 transitions. [2022-11-25 23:41:42,426 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 634 transitions. Word has length 27 [2022-11-25 23:41:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:42,427 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 634 transitions. [2022-11-25 23:41:42,427 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-25 23:41:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 634 transitions. [2022-11-25 23:41:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:41:42,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:42,429 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-25 23:41:42,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:42,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:42,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-25 23:41:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:42,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271925026] [2022-11-25 23:41:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:42,645 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-25 23:41:42,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:42,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:42,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:42,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:41:42,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:42,866 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-25 23:41:43,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-25 23:41:43,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:43,140 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:43,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271925026] [2022-11-25 23:41:43,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271925026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:43,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:43,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333104748] [2022-11-25 23:41:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:43,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:41:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:41:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:43,142 INFO L87 Difference]: Start difference. First operand 562 states and 634 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-25 23:41:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:45,644 INFO L93 Difference]: Finished difference Result 644 states and 706 transitions. [2022-11-25 23:41:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:41:45,645 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-25 23:41:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:45,648 INFO L225 Difference]: With dead ends: 644 [2022-11-25 23:41:45,648 INFO L226 Difference]: Without dead ends: 644 [2022-11-25 23:41:45,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-25 23:41:45,649 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 351 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:45,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 917 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-25 23:41:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-25 23:41:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 558. [2022-11-25 23:41:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 326 states have (on average 1.852760736196319) internal successors, (604), 552 states have internal predecessors, (604), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 630 transitions. [2022-11-25 23:41:45,668 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 630 transitions. Word has length 27 [2022-11-25 23:41:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:45,668 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 630 transitions. [2022-11-25 23:41:45,669 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-25 23:41:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 630 transitions. [2022-11-25 23:41:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:41:45,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:45,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:45,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:45,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:45,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-25 23:41:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:45,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303598392] [2022-11-25 23:41:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:45,890 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-25 23:41:45,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:45,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:45,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:46,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:41:46,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:46,186 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-25 23:41:46,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:46,186 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:46,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303598392] [2022-11-25 23:41:46,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303598392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:46,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:46,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:41:46,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743871572] [2022-11-25 23:41:46,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:46,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:41:46,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:41:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:46,190 INFO L87 Difference]: Start difference. First operand 558 states and 630 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:46,258 INFO L93 Difference]: Finished difference Result 558 states and 626 transitions. [2022-11-25 23:41:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:41:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 23:41:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:46,261 INFO L225 Difference]: With dead ends: 558 [2022-11-25 23:41:46,261 INFO L226 Difference]: Without dead ends: 558 [2022-11-25 23:41:46,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:41:46,264 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 511 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1101 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-25 23:41:46,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1101 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:41:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-25 23:41:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 552. [2022-11-25 23:41:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 320 states have (on average 1.85625) internal successors, (594), 546 states have internal predecessors, (594), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 620 transitions. [2022-11-25 23:41:46,285 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 620 transitions. Word has length 42 [2022-11-25 23:41:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:46,288 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 620 transitions. [2022-11-25 23:41:46,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 620 transitions. [2022-11-25 23:41:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 23:41:46,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:46,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:46,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:46,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:46,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-25 23:41:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554171601] [2022-11-25 23:41:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:46,507 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-25 23:41:46,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:46,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:46,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:46,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:41:46,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:47,118 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-25 23:41:47,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:47,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:47,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554171601] [2022-11-25 23:41:47,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554171601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:47,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:47,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468937717] [2022-11-25 23:41:47,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:47,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:41:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:41:47,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:47,121 INFO L87 Difference]: Start difference. First operand 552 states and 620 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:47,235 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2022-11-25 23:41:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:41:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-25 23:41:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:47,240 INFO L225 Difference]: With dead ends: 598 [2022-11-25 23:41:47,240 INFO L226 Difference]: Without dead ends: 598 [2022-11-25 23:41:47,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:47,241 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 67 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:47,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1008 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:41:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-25 23:41:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-11-25 23:41:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 366 states have (on average 1.7486338797814207) internal successors, (640), 592 states have internal predecessors, (640), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 666 transitions. [2022-11-25 23:41:47,258 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 666 transitions. Word has length 50 [2022-11-25 23:41:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:47,259 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 666 transitions. [2022-11-25 23:41:47,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 666 transitions. [2022-11-25 23:41:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:41:47,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:47,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:47,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:47,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:47,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-25 23:41:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:47,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145413285] [2022-11-25 23:41:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:47,491 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-25 23:41:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:47,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:47,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:47,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:41:47,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:47,940 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-25 23:41:47,952 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-25 23:41:48,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:48,606 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-25 23:41:48,629 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:41:48,630 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-25 23:41:48,657 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-25 23:41:48,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:48,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145413285] [2022-11-25 23:41:48,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145413285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:48,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:48,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064027647] [2022-11-25 23:41:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:48,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:41:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:41:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:48,660 INFO L87 Difference]: Start difference. First operand 598 states and 666 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:50,471 INFO L93 Difference]: Finished difference Result 567 states and 636 transitions. [2022-11-25 23:41:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:41:50,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-25 23:41:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:50,476 INFO L225 Difference]: With dead ends: 567 [2022-11-25 23:41:50,476 INFO L226 Difference]: Without dead ends: 567 [2022-11-25 23:41:50,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:50,477 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 393 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:50,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 311 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 23:41:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-25 23:41:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 528. [2022-11-25 23:41:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 334 states have (on average 1.6047904191616766) internal successors, (536), 522 states have internal predecessors, (536), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 562 transitions. [2022-11-25 23:41:50,494 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 562 transitions. Word has length 53 [2022-11-25 23:41:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:50,495 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 562 transitions. [2022-11-25 23:41:50,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 562 transitions. [2022-11-25 23:41:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:41:50,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:50,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:50,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:50,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:50,717 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-25 23:41:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:50,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494733297] [2022-11-25 23:41:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:50,719 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-25 23:41:50,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:50,720 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:50,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:51,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:41:51,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:51,026 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-25 23:41:51,040 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-25 23:41:51,077 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-25 23:41:51,090 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-25 23:41:51,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:51,091 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:51,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494733297] [2022-11-25 23:41:51,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494733297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:51,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:51,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:41:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800304993] [2022-11-25 23:41:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:51,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:41:51,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:41:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:41:51,093 INFO L87 Difference]: Start difference. First operand 528 states and 562 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:53,261 INFO L93 Difference]: Finished difference Result 527 states and 561 transitions. [2022-11-25 23:41:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:41:53,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:41:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:53,265 INFO L225 Difference]: With dead ends: 527 [2022-11-25 23:41:53,266 INFO L226 Difference]: Without dead ends: 527 [2022-11-25 23:41:53,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:41:53,267 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 4 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:53,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1317 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 23:41:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-25 23:41:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2022-11-25 23:41:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 334 states have (on average 1.6017964071856288) internal successors, (535), 521 states have internal predecessors, (535), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 561 transitions. [2022-11-25 23:41:53,281 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 561 transitions. Word has length 58 [2022-11-25 23:41:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:53,281 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 561 transitions. [2022-11-25 23:41:53,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 561 transitions. [2022-11-25 23:41:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:41:53,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:53,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:53,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:53,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:53,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-25 23:41:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:53,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351063433] [2022-11-25 23:41:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:53,501 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-25 23:41:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:53,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:53,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:53,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:41:53,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:53,827 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-25 23:41:53,869 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-25 23:41:53,884 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-25 23:41:53,954 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-25 23:41:53,963 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-25 23:41:53,985 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-25 23:41:53,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:53,986 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351063433] [2022-11-25 23:41:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351063433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:53,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:53,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:41:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128754698] [2022-11-25 23:41:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:41:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:41:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:41:53,988 INFO L87 Difference]: Start difference. First operand 527 states and 561 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:56,731 INFO L93 Difference]: Finished difference Result 526 states and 560 transitions. [2022-11-25 23:41:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:41:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:41:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:56,735 INFO L225 Difference]: With dead ends: 526 [2022-11-25 23:41:56,736 INFO L226 Difference]: Without dead ends: 526 [2022-11-25 23:41:56,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:41:56,737 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:56,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1327 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-25 23:41:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-25 23:41:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-11-25 23:41:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 333 states have (on average 1.6036036036036037) internal successors, (534), 520 states have internal predecessors, (534), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 23:41:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 560 transitions. [2022-11-25 23:41:56,750 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 560 transitions. Word has length 58 [2022-11-25 23:41:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:56,751 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 560 transitions. [2022-11-25 23:41:56,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:41:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 560 transitions. [2022-11-25 23:41:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 23:41:56,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:56,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:56,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-25 23:41:56,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:56,970 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1630154942, now seen corresponding path program 1 times [2022-11-25 23:41:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:56,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526782114] [2022-11-25 23:41:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:56,971 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-25 23:41:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:56,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:57,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:57,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:41:57,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:41:57,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:41:57,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526782114] [2022-11-25 23:41:57,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526782114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:57,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:57,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:41:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706968421] [2022-11-25 23:41:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:57,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:41:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:41:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:41:57,367 INFO L87 Difference]: Start difference. First operand 526 states and 560 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:41:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:57,427 INFO L93 Difference]: Finished difference Result 529 states and 564 transitions. [2022-11-25 23:41:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:41:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-25 23:41:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:57,432 INFO L225 Difference]: With dead ends: 529 [2022-11-25 23:41:57,432 INFO L226 Difference]: Without dead ends: 529 [2022-11-25 23:41:57,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:41:57,433 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 2 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:57,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1525 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:41:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-11-25 23:41:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-11-25 23:41:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 335 states have (on average 1.6029850746268657) internal successors, (537), 523 states have internal predecessors, (537), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 23:41:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 564 transitions. [2022-11-25 23:41:57,448 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 564 transitions. Word has length 66 [2022-11-25 23:41:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:57,448 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 564 transitions. [2022-11-25 23:41:57,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:41:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 564 transitions. [2022-11-25 23:41:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 23:41:57,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:57,450 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-25 23:41:57,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:41:57,667 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:41:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 584186051, now seen corresponding path program 1 times [2022-11-25 23:41:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:41:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327643857] [2022-11-25 23:41:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:41:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:41:57,670 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:57,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:41:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:58,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:41:58,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:58,085 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-25 23:41:58,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:58,201 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-25 23:41:58,202 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:41:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327643857] [2022-11-25 23:41:58,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327643857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [643721963] [2022-11-25 23:41:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:58,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:41:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:41:58,206 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:41:58,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-25 23:41:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:58,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:41:58,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:58,819 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-25 23:41:58,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:58,873 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-25 23:41:58,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [643721963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184033721] [2022-11-25 23:41:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:58,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:58,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:58,883 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:58,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 23:41:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:59,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:41:59,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:59,209 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-25 23:41:59,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:59,265 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-25 23:41:59,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184033721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:59,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:41:59,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-25 23:41:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294328602] [2022-11-25 23:41:59,267 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:59,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:41:59,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:41:59,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:41:59,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:41:59,269 INFO L87 Difference]: Start difference. First operand 529 states and 564 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:41:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:59,517 INFO L93 Difference]: Finished difference Result 541 states and 581 transitions. [2022-11-25 23:41:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:41:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-25 23:41:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:59,521 INFO L225 Difference]: With dead ends: 541 [2022-11-25 23:41:59,521 INFO L226 Difference]: Without dead ends: 541 [2022-11-25 23:41:59,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:41:59,523 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 12 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:59,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1529 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:41:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-25 23:41:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2022-11-25 23:41:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 344 states have (on average 1.6046511627906976) internal successors, (552), 532 states have internal predecessors, (552), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 23:41:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 579 transitions. [2022-11-25 23:41:59,536 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 579 transitions. Word has length 67 [2022-11-25 23:41:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:59,536 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 579 transitions. [2022-11-25 23:41:59,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:41:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 579 transitions. [2022-11-25 23:41:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 23:41:59,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:59,538 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:59,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:59,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:59,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:00,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.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-25 23:42:00,150 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:42:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1893632510, now seen corresponding path program 2 times [2022-11-25 23:42:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:00,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371744048] [2022-11-25 23:42:00,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:42:00,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:00,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:00,158 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:00,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:00,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:42:00,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:00,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:42:00,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:00,790 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-25 23:42:00,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:01,087 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-25 23:42:01,088 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:01,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371744048] [2022-11-25 23:42:01,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371744048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:01,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [844728481] [2022-11-25 23:42:01,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:42:01,088 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:01,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:42:01,091 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:42:01,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-25 23:42:02,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:42:02,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:02,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:42:02,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:02,505 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-25 23:42:02,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:02,622 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-25 23:42:02,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [844728481] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463496684] [2022-11-25 23:42:02,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:42:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:02,624 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:02,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 23:42:30,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:42:30,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:30,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:42:30,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:30,803 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:42:30,803 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-25 23:42:30,853 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-25 23:42:31,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:42:31,478 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-25 23:42:31,592 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-25 23:42:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:42:31,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:31,823 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 23:42:31,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 23:42:31,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-25 23:42:31,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463496684] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:31,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 23:42:31,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-25 23:42:31,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773589228] [2022-11-25 23:42:31,839 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:31,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 23:42:31,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 23:42:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-25 23:42:31,841 INFO L87 Difference]: Start difference. First operand 539 states and 579 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:42:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:42,728 INFO L93 Difference]: Finished difference Result 566 states and 614 transitions. [2022-11-25 23:42:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 23:42:42,729 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-11-25 23:42:42,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:42,731 INFO L225 Difference]: With dead ends: 566 [2022-11-25 23:42:42,731 INFO L226 Difference]: Without dead ends: 562 [2022-11-25 23:42:42,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-11-25 23:42:42,734 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 887 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 53 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:42,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 3045 Invalid, 3615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 3556 Invalid, 6 Unknown, 0 Unchecked, 8.8s Time] [2022-11-25 23:42:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-25 23:42:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 547. [2022-11-25 23:42:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 353 states have (on average 1.594900849858357) internal successors, (563), 540 states have internal predecessors, (563), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 23:42:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 590 transitions. [2022-11-25 23:42:42,749 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 590 transitions. Word has length 70 [2022-11-25 23:42:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:42,750 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 590 transitions. [2022-11-25 23:42:42,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:42:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 590 transitions. [2022-11-25 23:42:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 23:42:42,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:42,751 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:42,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:42,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:43,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:43,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:43,370 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:42:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1191355359, now seen corresponding path program 1 times [2022-11-25 23:42:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422644230] [2022-11-25 23:42:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:43,371 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-25 23:42:43,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:43,373 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:43,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:43,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:42:43,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:43,993 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-25 23:42:43,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:44,901 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-25 23:42:44,902 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:44,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422644230] [2022-11-25 23:42:44,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422644230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:44,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873082333] [2022-11-25 23:42:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:44,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:44,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:42:44,904 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:42:44,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-25 23:42:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:45,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:42:45,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:45,765 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-25 23:42:45,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:46,026 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-25 23:42:46,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [873082333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:46,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082155874] [2022-11-25 23:42:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:46,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:46,031 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:46,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 23:42:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:46,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:42:46,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:46,570 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-25 23:42:46,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:48,051 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-25 23:42:48,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082155874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:48,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:42:48,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-25 23:42:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099725864] [2022-11-25 23:42:48,052 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:48,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 23:42:48,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 23:42:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:42:48,055 INFO L87 Difference]: Start difference. First operand 547 states and 590 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:42:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:52,358 INFO L93 Difference]: Finished difference Result 589 states and 647 transitions. [2022-11-25 23:42:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 23:42:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-11-25 23:42:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:52,363 INFO L225 Difference]: With dead ends: 589 [2022-11-25 23:42:52,363 INFO L226 Difference]: Without dead ends: 583 [2022-11-25 23:42:52,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-25 23:42:52,367 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 58 mSDsluCounter, 6170 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6688 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:52,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 6688 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 23:42:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-25 23:42:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 565. [2022-11-25 23:42:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 558 states have internal predecessors, (586), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 23:42:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 613 transitions. [2022-11-25 23:42:52,382 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 613 transitions. Word has length 76 [2022-11-25 23:42:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:52,383 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 613 transitions. [2022-11-25 23:42:52,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:42:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 613 transitions. [2022-11-25 23:42:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 23:42:52,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:52,385 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:52,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-25 23:42:52,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:52,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:52,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:53,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:42:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -170909793, now seen corresponding path program 2 times [2022-11-25 23:42:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:53,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288754917] [2022-11-25 23:42:53,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:42:53,001 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-25 23:42:53,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:53,003 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:53,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:42:53,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:42:53,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:53,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:42:53,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:54,678 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-25 23:42:54,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:59,818 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-25 23:42:59,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:59,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288754917] [2022-11-25 23:42:59,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288754917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:59,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [182489288] [2022-11-25 23:42:59,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:42:59,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:42:59,821 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:42:59,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-25 23:43:01,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:01,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:01,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:43:01,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:02,278 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-25 23:43:02,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:03,836 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-25 23:43:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [182489288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185240121] [2022-11-25 23:43:03,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:03,838 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:03,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-25 23:43:16,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:16,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:16,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 23:43:16,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:16,630 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:16,630 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-25 23:43:16,638 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-25 23:43:16,800 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-25 23:43:16,814 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-25 23:43:17,326 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-25 23:43:17,333 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-25 23:43:17,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371)))) is different from true [2022-11-25 23:43:17,585 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-25 23:43:17,648 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375))) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:43:17,671 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2378))) (exists ((v_ArrVal_2377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2377))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:43:17,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:43:18,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2022-11-25 23:43:18,116 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:43:18,133 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:43:18,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:43:18,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-11-25 23:43:18,191 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395)))) is different from true [2022-11-25 23:43:18,388 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:43:18,406 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401)))) is different from true [2022-11-25 23:43:18,596 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:43:18,611 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407)))) is different from true [2022-11-25 23:43:18,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-11-25 23:43:18,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:43:18,656 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413)))) is different from true [2022-11-25 23:43:18,710 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:18,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 23:43:18,718 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-25 23:43:18,962 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-25 23:43:18,971 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-25 23:43:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 243 not checked. [2022-11-25 23:43:19,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:20,258 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2022-11-25 23:43:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185240121] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:20,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 23:43:20,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 27] total 76 [2022-11-25 23:43:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982039639] [2022-11-25 23:43:20,268 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:20,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-25 23:43:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-25 23:43:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=2840, Unknown=42, NotChecked=2546, Total=6162 [2022-11-25 23:43:20,273 INFO L87 Difference]: Start difference. First operand 565 states and 613 transitions. Second operand has 76 states, 75 states have (on average 2.52) internal successors, (189), 76 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:43:50,588 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr142|) |c_#Ultimate.C_memset_#amount|)) (.cse4 (bvult |c_#Ultimate.C_memset_#t~loopctr142| |c_#Ultimate.C_memset_#amount|)) (.cse8 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|)) (.cse6 (bvult (bvadd (_ bv8 32) |c_#Ultimate.C_memset_#t~loopctr142|) |c_#Ultimate.C_memset_#amount|)) (.cse3 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv3 32)) |c_#Ultimate.C_memset_#amount|)) (.cse11 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr142|) |c_#Ultimate.C_memset_#amount|)) (.cse10 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv7 32)) |c_#Ultimate.C_memset_#amount|)) (.cse9 (bvult (bvadd (_ bv6 32) |c_#Ultimate.C_memset_#t~loopctr142|) |c_#Ultimate.C_memset_#amount|)) (.cse7 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv9 32)) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32)))) (.cse5 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv10 32)) |c_#Ultimate.C_memset_#amount|))) (and (or .cse0 .cse1 (not .cse2)) (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (or .cse0 .cse3 (not .cse4)) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (or .cse0 (not .cse5) (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv11 32)) |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (or .cse0 (not .cse6) .cse7) (or (not .cse1) .cse0 .cse8) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (or .cse4 .cse0) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (or (not .cse8) .cse0 .cse9) (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (or .cse0 .cse6 (not .cse10)) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401))) (or (not .cse3) .cse0 .cse11) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (or .cse2 .cse0 (not .cse11)) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (or .cse10 (not .cse9) .cse0) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (or (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv13 32)) |c_#Ultimate.C_memset_#amount|) .cse0 (not (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv12 32)) |c_#Ultimate.C_memset_#amount|))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410))) (or (not .cse7) .cse0 .cse5))) is different from true [2022-11-25 23:44:13,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401))) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2400) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2395))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-11-25 23:44:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:44:45,419 INFO L93 Difference]: Finished difference Result 1006 states and 1141 transitions. [2022-11-25 23:44:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-25 23:44:45,420 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 2.52) internal successors, (189), 76 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2022-11-25 23:44:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:44:45,425 INFO L225 Difference]: With dead ends: 1006 [2022-11-25 23:44:45,425 INFO L226 Difference]: Without dead ends: 992 [2022-11-25 23:44:45,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 348 SyntacticMatches, 18 SemanticMatches, 164 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 4164 ImplicationChecksByTransitivity, 55.7s TimeCoverageRelationStatistics Valid=3424, Invalid=16840, Unknown=700, NotChecked=6426, Total=27390 [2022-11-25 23:44:45,433 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 1326 mSDsluCounter, 8007 mSDsCounter, 0 mSdLazyCounter, 12720 mSolverCounterSat, 126 mSolverCounterUnsat, 429 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 8297 SdHoareTripleChecker+Invalid, 31581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 12720 IncrementalHoareTripleChecker+Invalid, 429 IncrementalHoareTripleChecker+Unknown, 18306 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:44:45,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 8297 Invalid, 31581 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [126 Valid, 12720 Invalid, 429 Unknown, 18306 Unchecked, 36.5s Time] [2022-11-25 23:44:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-25 23:44:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 600. [2022-11-25 23:44:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 407 states have (on average 1.5454545454545454) internal successors, (629), 593 states have internal predecessors, (629), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 23:44:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 656 transitions. [2022-11-25 23:44:45,457 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 656 transitions. Word has length 88 [2022-11-25 23:44:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:44:45,458 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 656 transitions. [2022-11-25 23:44:45,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 2.52) internal successors, (189), 76 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:44:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 656 transitions. [2022-11-25 23:44:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 23:44:45,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:45,459 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:44:45,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:44:45,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:45,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:46,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:46,076 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:44:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1359083593, now seen corresponding path program 1 times [2022-11-25 23:44:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:44:46,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457375953] [2022-11-25 23:44:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:46,077 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-25 23:44:46,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:44:46,078 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:44:46,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:44:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:47,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 23:44:47,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:47,118 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-25 23:44:47,243 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:44:47,243 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-25 23:44:47,278 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-25 23:44:47,383 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-25 23:44:47,740 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2832)))) is different from true [2022-11-25 23:44:48,551 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854)))) is different from true [2022-11-25 23:44:49,225 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:44:49,225 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-25 23:44:49,378 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:44:49,378 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-25 23:44:49,403 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-25 23:44:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-25 23:44:49,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:44:51,576 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (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_2869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:44:51,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2869 (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~mem33#1.base| v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 23:44:51,934 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:44:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457375953] [2022-11-25 23:44:51,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457375953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:51,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663927245] [2022-11-25 23:44:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:51,935 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:44:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:44:51,939 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:44:51,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-25 23:44:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:56,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 23:44:56,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:56,496 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:44:56,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:44:56,972 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-25 23:44:56,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:44:57,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-25 23:44:57,379 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 34 treesize of output 16 [2022-11-25 23:45:01,747 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:45:01,747 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-25 23:45:02,025 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:45:02,027 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-25 23:45:02,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-11-25 23:45:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 23:45:02,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:02,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3322) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-25 23:45:02,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3368))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:45:02,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1663927245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:02,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385731393] [2022-11-25 23:45:02,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:02,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:02,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:02,722 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:02,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-25 23:45:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:03,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 23:45:03,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:03,574 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:45:03,574 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-25 23:45:03,633 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-25 23:45:03,857 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3729))) is different from true [2022-11-25 23:45:03,863 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3730))) is different from true [2022-11-25 23:45:03,869 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3731) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:03,876 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3732) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:03,885 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3733))) is different from true [2022-11-25 23:45:03,891 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3734))) is different from true [2022-11-25 23:45:03,898 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3735 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3735))) is different from true [2022-11-25 23:45:03,904 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3736))) is different from true [2022-11-25 23:45:03,913 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3737))) is different from true [2022-11-25 23:45:03,921 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3738) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:03,928 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3739) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:03,936 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3740))) is different from true [2022-11-25 23:45:03,943 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3741))) is different from true [2022-11-25 23:45:03,950 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3742) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:03,957 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3743))) is different from true [2022-11-25 23:45:03,965 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3744))) is different from true [2022-11-25 23:45:03,972 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3745) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:03,980 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3746))) is different from true [2022-11-25 23:45:03,987 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3747))) is different from true [2022-11-25 23:45:03,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3748))) is different from true [2022-11-25 23:45:04,002 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3749) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3750))) is different from true [2022-11-25 23:45:04,018 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3751))) is different from true [2022-11-25 23:45:04,026 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3752))) is different from true [2022-11-25 23:45:04,034 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3753))) is different from true [2022-11-25 23:45:04,043 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3754))) is different from true [2022-11-25 23:45:04,051 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3755))) is different from true [2022-11-25 23:45:04,059 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3756))) is different from true [2022-11-25 23:45:04,067 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3757))) is different from true [2022-11-25 23:45:04,075 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3758))) is different from true [2022-11-25 23:45:04,083 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3759) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,090 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3760))) is different from true [2022-11-25 23:45:04,098 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3761))) is different from true [2022-11-25 23:45:04,105 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3762))) is different from true [2022-11-25 23:45:04,113 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3763) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,121 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3764) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,129 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3765) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,137 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3766))) is different from true [2022-11-25 23:45:04,145 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3767) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,152 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3768))) is different from true [2022-11-25 23:45:04,160 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3769) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,168 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3770))) is different from true [2022-11-25 23:45:04,175 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3771))) is different from true [2022-11-25 23:45:04,183 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3772) |c_#memory_$Pointer$.base|)) is different from true [2022-11-25 23:45:04,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:45:04,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 23:45:04,370 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:45:04,370 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-25 23:45:06,514 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-25 23:45:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 23:45:06,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:06,554 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 23:45:06,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 23:45:06,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-25 23:45:06,576 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-25 23:45:06,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3819)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-25 23:45:06,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385731393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:06,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:06,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 54] total 72 [2022-11-25 23:45:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845965449] [2022-11-25 23:45:06,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:06,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-25 23:45:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:45:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-25 23:45:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=751, Unknown=92, NotChecked=5724, Total=6806 [2022-11-25 23:45:06,980 INFO L87 Difference]: Start difference. First operand 600 states and 656 transitions. Second operand has 73 states, 69 states have (on average 3.289855072463768) internal successors, (227), 73 states have internal predecessors, (227), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:45:20,541 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3729))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) is different from true [2022-11-25 23:45:20,553 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2825) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3730))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2832)))) is different from true [2022-11-25 23:45:20,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2825) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854))) (exists ((v_ArrVal_2832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2832)))) is different from true [2022-11-25 23:45:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:22,141 INFO L93 Difference]: Finished difference Result 1127 states and 1261 transitions. [2022-11-25 23:45:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-25 23:45:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 3.289855072463768) internal successors, (227), 73 states have internal predecessors, (227), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 113 [2022-11-25 23:45:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:22,145 INFO L225 Difference]: With dead ends: 1127 [2022-11-25 23:45:22,146 INFO L226 Difference]: Without dead ends: 1127 [2022-11-25 23:45:22,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 190 SyntacticMatches, 91 SemanticMatches, 102 ConstructedPredicates, 56 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=468, Invalid=1875, Unknown=137, NotChecked=8232, Total=10712 [2022-11-25 23:45:22,149 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 2229 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 98 mSolverCounterUnsat, 1026 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 34821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 1026 IncrementalHoareTripleChecker+Unknown, 30675 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:22,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 2596 Invalid, 34821 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [98 Valid, 3022 Invalid, 1026 Unknown, 30675 Unchecked, 13.5s Time] [2022-11-25 23:45:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-25 23:45:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 599. [2022-11-25 23:45:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 407 states have (on average 1.542997542997543) internal successors, (628), 592 states have internal predecessors, (628), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 23:45:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 655 transitions. [2022-11-25 23:45:22,177 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 655 transitions. Word has length 113 [2022-11-25 23:45:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:22,177 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 655 transitions. [2022-11-25 23:45:22,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 3.289855072463768) internal successors, (227), 73 states have internal predecessors, (227), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:45:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 655 transitions. [2022-11-25 23:45:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 23:45:22,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:22,180 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:22,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:22,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:22,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:22,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:45:22,805 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-25 23:45:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1359083592, now seen corresponding path program 1 times [2022-11-25 23:45:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:45:22,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192868616] [2022-11-25 23:45:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:22,807 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-25 23:45:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:45:22,808 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:45:22,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/mathsat -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-25 23:45:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:23,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 23:45:23,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:23,989 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-25 23:45:24,157 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-25 23:45:24,192 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:45:24,193 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-25 23:45:24,222 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-25 23:45:24,234 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-25 23:45:24,393 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-25 23:45:24,401 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-25 23:45:24,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-11-25 23:45:24,664 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (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-25 23:45:24,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194)))) is different from true [2022-11-25 23:45:24,700 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197)))) is different from true [2022-11-25 23:45:24,804 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2022-11-25 23:45:24,820 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204)))) is different from true [2022-11-25 23:45:24,835 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:45:24,851 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208)))) is different from true [2022-11-25 23:45:24,866 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:45:24,882 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2022-11-25 23:45:24,986 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:45:25,001 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-11-25 23:45:25,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223)))) is different from true [2022-11-25 23:45:25,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224)))) is different from true [2022-11-25 23:45:25,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:45:25,062 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229)))) is different from true [2022-11-25 23:45:25,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231)))) is different from true [2022-11-25 23:45:25,094 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233)))) is different from true [2022-11-25 23:45:25,109 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234)))) is different from true [2022-11-25 23:45:25,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237)))) is different from true [2022-11-25 23:45:25,141 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:45:25,157 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4241))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240)))) is different from true [2022-11-25 23:45:25,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243)))) is different from true [2022-11-25 23:45:25,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-11-25 23:45:25,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-11-25 23:45:25,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248)))) is different from true [2022-11-25 23:45:25,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:45:25,252 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:45:25,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-11-25 23:45:25,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257)))) is different from true [2022-11-25 23:45:25,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:45:25,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:45:25,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262)))) is different from true [2022-11-25 23:45:25,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265)))) is different from true [2022-11-25 23:45:25,360 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4266) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267)))) is different from true [2022-11-25 23:45:25,375 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269)))) is different from true [2022-11-25 23:45:25,391 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:45:25,461 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:45:25,462 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-25 23:45:25,504 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-25 23:45:25,661 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:45:25,661 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-25 23:45:25,679 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-25 23:45:25,718 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-25 23:45:25,727 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-25 23:45:25,770 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-25 23:45:25,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:26,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:45:26,065 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_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 23:45:27,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4364))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4365) .cse0 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4365) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 23:45:27,330 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:45:27,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192868616] [2022-11-25 23:45:27,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192868616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:27,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1577930939] [2022-11-25 23:45:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:45:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:45:27,332 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:45:27,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-25 23:47:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:27,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 23:47:27,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:27,370 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-25 23:47:27,516 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:47:27,516 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-25 23:47:27,523 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-25 23:47:27,538 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-25 23:47:27,551 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-25 23:47:27,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 23:47:27,621 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-25 23:47:27,678 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,694 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733)))) is different from true [2022-11-25 23:47:27,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:27,721 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:27,734 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740)))) is different from true [2022-11-25 23:47:27,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,774 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744)))) is different from true [2022-11-25 23:47:27,793 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747)))) is different from true [2022-11-25 23:47:27,807 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748))) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:27,820 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,832 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-11-25 23:47:27,863 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,876 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:27,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-25 23:47:27,914 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:27,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:27,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766)))) is different from true [2022-11-25 23:47:27,962 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:27,977 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771)))) is different from true [2022-11-25 23:47:27,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:28,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:28,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777)))) is different from true [2022-11-25 23:47:28,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778)))) is different from true [2022-11-25 23:47:28,051 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:28,064 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782)))) is different from true [2022-11-25 23:47:28,076 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784)))) is different from true [2022-11-25 23:47:28,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787)))) is different from true [2022-11-25 23:47:28,101 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4789) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:28,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4790)))) is different from true [2022-11-25 23:47:28,130 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793)))) is different from true [2022-11-25 23:47:28,143 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794)))) is different from true [2022-11-25 23:47:28,155 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-25 23:47:28,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799)))) is different from true [2022-11-25 23:47:28,182 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4801) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:28,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4802))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803)))) is different from true [2022-11-25 23:47:28,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:28,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:28,233 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4808) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809)))) is different from true [2022-11-25 23:47:28,250 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811)))) is different from true [2022-11-25 23:47:28,262 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4812) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4813)))) is different from true [2022-11-25 23:47:28,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814)))) is different from true [2022-11-25 23:47:28,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:28,349 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:47:28,349 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-25 23:47:28,363 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-25 23:47:28,437 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:47:28,437 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-25 23:47:28,447 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-25 23:47:28,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 23:47:28,481 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-25 23:47:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 23:47:28,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:28,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:47:28,594 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_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 23:47:29,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4911))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4910) .cse0 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4910) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 23:47:29,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1577930939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990363597] [2022-11-25 23:47:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:29,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:29,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:29,590 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:29,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b4a5f-3712-4c54-acb0-6bd9dc58daf4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 23:47:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:30,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 23:47:30,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:30,399 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-25 23:47:30,419 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:47:30,420 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-25 23:47:30,428 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-25 23:47:30,437 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-25 23:47:30,504 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-25 23:47:30,509 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-25 23:47:30,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-11-25 23:47:30,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277)))) is different from true [2022-11-25 23:47:30,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-25 23:47:30,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-25 23:47:30,626 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:30,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291)))) is different from true [2022-11-25 23:47:30,674 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-11-25 23:47:30,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295))) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296)))) is different from true [2022-11-25 23:47:30,697 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,709 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,721 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-11-25 23:47:30,733 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304)))) is different from true [2022-11-25 23:47:30,745 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-11-25 23:47:30,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-25 23:47:30,770 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309)))) is different from true [2022-11-25 23:47:30,783 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,799 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313)))) is different from true [2022-11-25 23:47:30,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,844 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-11-25 23:47:30,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322)))) is different from true [2022-11-25 23:47:30,874 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,889 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326)))) is different from true [2022-11-25 23:47:30,904 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:30,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:30,933 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:30,946 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-11-25 23:47:30,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335)))) is different from true [2022-11-25 23:47:30,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337)))) is different from true [2022-11-25 23:47:30,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339)))) is different from true [2022-11-25 23:47:31,002 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341))) (exists ((v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5342)))) is different from true [2022-11-25 23:47:31,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344))) (exists ((v_ArrVal_5343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5343)))) is different from true [2022-11-25 23:47:31,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346)))) is different from true [2022-11-25 23:47:31,055 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:47:31,067 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350)))) is different from true [2022-11-25 23:47:31,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:31,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354)))) is different from true [2022-11-25 23:47:31,111 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356)))) is different from true [2022-11-25 23:47:31,126 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357))) (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:31,141 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360)))) is different from true [2022-11-25 23:47:31,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5362)))) is different from true [2022-11-25 23:47:31,212 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:47:31,212 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-25 23:47:31,219 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-25 23:47:31,302 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:47:31,302 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-25 23:47:31,315 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-25 23:47:31,340 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-25 23:47:31,347 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-25 23:47:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 23:47:31,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:31,421 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 23:47:31,460 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_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 23:47:32,498 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5456))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5455) .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5455) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 23:47:32,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990363597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:32,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:32,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 52, 53] total 135 [2022-11-25 23:47:32,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984942345] [2022-11-25 23:47:32,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:47:32,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-25 23:47:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:47:32,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-25 23:47:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=254, Unknown=141, NotChecked=20770, Total=21462 [2022-11-25 23:47:32,516 INFO L87 Difference]: Start difference. First operand 599 states and 655 transitions. Second operand has 136 states, 134 states have (on average 1.6791044776119404) internal successors, (225), 136 states have internal predecessors, (225), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:47:33,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-11-25 23:47:33,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,448 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (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_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (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_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,546 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (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_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (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_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (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_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (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_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:47:33,589 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (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_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (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_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218))) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:47:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:39,386 INFO L93 Difference]: Finished difference Result 620 states and 682 transitions. [2022-11-25 23:47:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:47:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 134 states have (on average 1.6791044776119404) internal successors, (225), 136 states have internal predecessors, (225), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 113 [2022-11-25 23:47:39,389 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-25 23:47:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 134 states have (on average 1.6791044776119404) internal successors, (225), 136 states have internal predecessors, (225), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 113