./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- 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-e04fb08 [2022-11-16 11:37:28,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:37:28,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:37:28,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:37:28,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:37:28,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:37:28,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:37:28,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:37:28,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:37:28,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:37:28,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:37:28,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:37:28,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:37:28,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:37:28,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:37:28,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:37:28,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:37:28,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:37:28,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:37:28,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:37:28,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:37:28,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:37:28,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:37:28,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:37:28,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:37:28,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:37:28,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:37:28,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:37:28,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:37:28,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:37:28,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:37:28,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:37:28,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:37:28,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:37:28,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:37:28,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:37:28,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:37:28,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:37:28,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:37:28,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:37:28,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:37:28,744 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:37:28,794 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:37:28,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:37:28,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:37:28,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:37:28,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:37:28,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:37:28,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:37:28,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:37:28,798 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:37:28,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:37:28,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:37:28,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:37:28,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:37:28,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:37:28,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:37:28,800 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:37:28,801 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:37:28,801 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:37:28,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:37:28,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:37:28,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:37:28,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:37:28,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:37:28,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:37:28,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:37:28,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:28,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:37:28,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:37:28,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:37:28,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:37:28,803 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2022-11-16 11:37:29,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:37:29,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:37:29,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:37:29,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:37:29,207 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:37:29,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-16 11:37:29,289 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/974ea16e8/45f15dfd064d473aa4a7106208ca3af7/FLAGfde7dc10c [2022-11-16 11:37:29,940 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:37:29,940 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-16 11:37:29,961 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/974ea16e8/45f15dfd064d473aa4a7106208ca3af7/FLAGfde7dc10c [2022-11-16 11:37:30,179 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/974ea16e8/45f15dfd064d473aa4a7106208ca3af7 [2022-11-16 11:37:30,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:37:30,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:37:30,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:30,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:37:30,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:37:30,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:30" (1/1) ... [2022-11-16 11:37:30,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63dfb11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:30, skipping insertion in model container [2022-11-16 11:37:30,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:30" (1/1) ... [2022-11-16 11:37:30,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:37:30,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:37:30,898 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-16 11:37:31,081 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-16 11:37:31,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:31,113 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-16 11:37:31,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@358cdf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:31, skipping insertion in model container [2022-11-16 11:37:31,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:31,115 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 11:37:31,117 INFO L158 Benchmark]: Toolchain (without parser) took 932.95ms. Allocated memory is still 130.0MB. Free memory was 89.1MB in the beginning and 93.4MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:31,118 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory was 107.9MB in the beginning and 107.8MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:37:31,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 919.35ms. Allocated memory is still 130.0MB. Free memory was 88.9MB in the beginning and 93.7MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:31,121 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.32ms. Allocated memory is still 130.0MB. Free memory was 107.9MB in the beginning and 107.8MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 919.35ms. Allocated memory is still 130.0MB. Free memory was 88.9MB in the beginning and 93.7MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- 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-e04fb08 [2022-11-16 11:37:33,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:37:33,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:37:33,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:37:33,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:37:33,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:37:33,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:37:33,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:37:33,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:37:33,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:37:33,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:37:33,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:37:33,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:37:33,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:37:33,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:37:33,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:37:33,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:37:33,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:37:33,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:37:33,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:37:33,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:37:33,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:37:33,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:37:33,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:37:33,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:37:33,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:37:33,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:37:33,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:37:33,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:37:33,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:37:33,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:37:33,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:37:33,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:37:33,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:37:33,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:37:33,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:37:33,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:37:33,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:37:33,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:37:33,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:37:33,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:37:33,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:37:33,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:37:33,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:37:33,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:37:33,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:37:33,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:37:33,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:37:33,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:37:33,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:37:33,646 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:37:33,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:37:33,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:37:33,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:37:33,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:37:33,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:37:33,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:37:33,649 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:37:33,650 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:37:33,650 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:37:33,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:37:33,650 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:37:33,651 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:37:33,651 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:37:33,651 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:37:33,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:37:33,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:37:33,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:37:33,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:37:33,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:33,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:37:33,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:37:33,654 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:37:33,654 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:37:33,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:37:33,654 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2022-11-16 11:37:34,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:37:34,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:37:34,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:37:34,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:37:34,136 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:37:34,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-16 11:37:34,228 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/da46fd09c/288691988e8748b7b9a36083b160875f/FLAG9d7a5fd16 [2022-11-16 11:37:35,029 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:37:35,030 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-16 11:37:35,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/da46fd09c/288691988e8748b7b9a36083b160875f/FLAG9d7a5fd16 [2022-11-16 11:37:35,200 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/data/da46fd09c/288691988e8748b7b9a36083b160875f [2022-11-16 11:37:35,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:37:35,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:37:35,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:35,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:37:35,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:37:35,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:35" (1/1) ... [2022-11-16 11:37:35,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd5c905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:35, skipping insertion in model container [2022-11-16 11:37:35,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:35" (1/1) ... [2022-11-16 11:37:35,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:37:35,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:37:35,816 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-16 11:37:36,024 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-16 11:37:36,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:36,074 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 11:37:36,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:37:36,112 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-16 11:37:36,167 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-16 11:37:36,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:36,185 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:37:36,216 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-16 11:37:36,277 WARN L229 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_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-16 11:37:36,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:36,357 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:37:36,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36 WrapperNode [2022-11-16 11:37:36,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:36,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:37:36,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:37:36,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:37:36,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,509 INFO L138 Inliner]: procedures = 180, calls = 336, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1201 [2022-11-16 11:37:36,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:37:36,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:37:36,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:37:36,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:37:36,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:37:36,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:37:36,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:37:36,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:37:36,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (1/1) ... [2022-11-16 11:37:36,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:36,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:36,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:37:36,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:37:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 11:37:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:37:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:37:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:37:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 11:37:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 11:37:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:37:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:37:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:37:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:37:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-16 11:37:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:37:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:37:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:37:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:37:36,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:37:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:37:37,142 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:37:37,146 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:37:37,151 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 11:37:43,639 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:37:43,665 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:37:43,668 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-11-16 11:37:43,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:43 BoogieIcfgContainer [2022-11-16 11:37:43,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:37:43,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:37:43,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:37:43,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:37:43,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:37:35" (1/3) ... [2022-11-16 11:37:43,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e20901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:37:43, skipping insertion in model container [2022-11-16 11:37:43,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:36" (2/3) ... [2022-11-16 11:37:43,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e20901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:37:43, skipping insertion in model container [2022-11-16 11:37:43,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:43" (3/3) ... [2022-11-16 11:37:43,684 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2022-11-16 11:37:43,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:37:43,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 639 error locations. [2022-11-16 11:37:43,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:37:43,813 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;@367d27a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:37:43,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 639 error locations. [2022-11-16 11:37:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 1270 states, 623 states have (on average 2.258426966292135) internal successors, (1407), 1264 states have internal predecessors, (1407), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:37:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:37:43,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:43,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:37:43,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:37:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-11-16 11:37:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:43,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71481983] [2022-11-16 11:37:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:43,856 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-16 11:37:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:43,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:43,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:44,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:37:44,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:44,159 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-16 11:37:44,176 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-16 11:37:44,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:44,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:44,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71481983] [2022-11-16 11:37:44,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71481983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:44,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:44,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930826383] [2022-11-16 11:37:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:44,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:44,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:44,241 INFO L87 Difference]: Start difference. First operand has 1270 states, 623 states have (on average 2.258426966292135) internal successors, (1407), 1264 states have internal predecessors, (1407), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:47,422 INFO L93 Difference]: Finished difference Result 1442 states and 1526 transitions. [2022-11-16 11:37:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 11:37:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:47,449 INFO L225 Difference]: With dead ends: 1442 [2022-11-16 11:37:47,449 INFO L226 Difference]: Without dead ends: 1440 [2022-11-16 11:37:47,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:47,455 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 1179 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:47,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 926 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-16 11:37:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2022-11-16 11:37:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1255. [2022-11-16 11:37:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 623 states have (on average 2.110754414125201) internal successors, (1315), 1249 states have internal predecessors, (1315), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:37:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1331 transitions. [2022-11-16 11:37:47,557 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1331 transitions. Word has length 3 [2022-11-16 11:37:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:47,558 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1331 transitions. [2022-11-16 11:37:47,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1331 transitions. [2022-11-16 11:37:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:37:47,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:47,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:37:47,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:37:47,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:37:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-11-16 11:37:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:47,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264520622] [2022-11-16 11:37:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:47,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:37:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:47,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:47,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:47,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:37:47,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:47,983 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-16 11:37:47,998 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-16 11:37:47,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:47,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:47,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264520622] [2022-11-16 11:37:47,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264520622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:47,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:47,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564539327] [2022-11-16 11:37:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:48,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:48,002 INFO L87 Difference]: Start difference. First operand 1255 states and 1331 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:53,497 INFO L93 Difference]: Finished difference Result 1864 states and 1991 transitions. [2022-11-16 11:37:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 11:37:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:53,506 INFO L225 Difference]: With dead ends: 1864 [2022-11-16 11:37:53,507 INFO L226 Difference]: Without dead ends: 1864 [2022-11-16 11:37:53,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:53,508 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 650 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:53,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1746 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-16 11:37:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-11-16 11:37:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1455. [2022-11-16 11:37:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 824 states have (on average 2.095873786407767) internal successors, (1727), 1449 states have internal predecessors, (1727), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:37:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1743 transitions. [2022-11-16 11:37:53,545 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1743 transitions. Word has length 3 [2022-11-16 11:37:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:53,546 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1743 transitions. [2022-11-16 11:37:53,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1743 transitions. [2022-11-16 11:37:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:37:53,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:53,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:53,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:53,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:37:53,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:37:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-11-16 11:37:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:53,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020554034] [2022-11-16 11:37:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:53,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:37:53,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:53,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:53,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:53,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:37:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:54,003 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-16 11:37:54,012 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-16 11:37:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:54,127 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-16 11:37:54,153 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:37:54,154 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-16 11:37:54,187 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-16 11:37:54,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:54,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:54,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020554034] [2022-11-16 11:37:54,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020554034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:54,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:54,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052719683] [2022-11-16 11:37:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:54,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:54,197 INFO L87 Difference]: Start difference. First operand 1455 states and 1743 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:59,269 INFO L93 Difference]: Finished difference Result 1633 states and 1932 transitions. [2022-11-16 11:37:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:37:59,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 11:37:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:59,278 INFO L225 Difference]: With dead ends: 1633 [2022-11-16 11:37:59,278 INFO L226 Difference]: Without dead ends: 1633 [2022-11-16 11:37:59,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:59,280 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 1472 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:59,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 542 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-16 11:37:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-16 11:37:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1244. [2022-11-16 11:37:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 623 states have (on average 2.091492776886035) internal successors, (1303), 1238 states have internal predecessors, (1303), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:37:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1319 transitions. [2022-11-16 11:37:59,310 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1319 transitions. Word has length 7 [2022-11-16 11:37:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:59,310 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1319 transitions. [2022-11-16 11:37:59,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1319 transitions. [2022-11-16 11:37:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:37:59,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:59,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:59,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-16 11:37:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:37:59,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:37:59,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-11-16 11:37:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:59,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433609980] [2022-11-16 11:37:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:59,526 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-16 11:37:59,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:59,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:59,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:37:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:59,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:37:59,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:59,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:37:59,735 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-16 11:37:59,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:59,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433609980] [2022-11-16 11:37:59,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433609980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:59,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:59,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780425420] [2022-11-16 11:37:59,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:59,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:59,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:59,742 INFO L87 Difference]: Start difference. First operand 1244 states and 1319 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:03,018 INFO L93 Difference]: Finished difference Result 1571 states and 1675 transitions. [2022-11-16 11:38:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:03,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:38:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:03,031 INFO L225 Difference]: With dead ends: 1571 [2022-11-16 11:38:03,032 INFO L226 Difference]: Without dead ends: 1571 [2022-11-16 11:38:03,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:03,035 INFO L413 NwaCegarLoop]: 1161 mSDtfsCounter, 988 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:03,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1507 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-16 11:38:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-11-16 11:38:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1195. [2022-11-16 11:38:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 623 states have (on average 2.012841091492777) internal successors, (1254), 1189 states have internal predecessors, (1254), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1270 transitions. [2022-11-16 11:38:03,087 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1270 transitions. Word has length 8 [2022-11-16 11:38:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:03,088 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1270 transitions. [2022-11-16 11:38:03,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1270 transitions. [2022-11-16 11:38:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:38:03,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:03,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:03,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:03,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:03,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-11-16 11:38:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:03,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855084877] [2022-11-16 11:38:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:03,319 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-16 11:38:03,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:03,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:03,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:03,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:38:03,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:03,527 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-16 11:38:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:03,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:03,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855084877] [2022-11-16 11:38:03,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855084877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:03,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:03,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667642690] [2022-11-16 11:38:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:03,566 INFO L87 Difference]: Start difference. First operand 1195 states and 1270 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:08,165 INFO L93 Difference]: Finished difference Result 1649 states and 1756 transitions. [2022-11-16 11:38:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:38:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:08,173 INFO L225 Difference]: With dead ends: 1649 [2022-11-16 11:38:08,173 INFO L226 Difference]: Without dead ends: 1649 [2022-11-16 11:38:08,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:08,174 INFO L413 NwaCegarLoop]: 1370 mSDtfsCounter, 673 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:08,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1910 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-16 11:38:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-11-16 11:38:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1217. [2022-11-16 11:38:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 655 states have (on average 2.0) internal successors, (1310), 1211 states have internal predecessors, (1310), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1326 transitions. [2022-11-16 11:38:08,205 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1326 transitions. Word has length 8 [2022-11-16 11:38:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:08,206 INFO L495 AbstractCegarLoop]: Abstraction has 1217 states and 1326 transitions. [2022-11-16 11:38:08,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1326 transitions. [2022-11-16 11:38:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:38:08,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:08,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:08,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-16 11:38:08,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:08,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:08,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash 693876885, now seen corresponding path program 1 times [2022-11-16 11:38:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:08,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151607089] [2022-11-16 11:38:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:08,422 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-16 11:38:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:08,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:08,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:08,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:38:08,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:08,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:08,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151607089] [2022-11-16 11:38:08,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151607089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:08,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:08,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:08,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067298129] [2022-11-16 11:38:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:08,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:08,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:08,749 INFO L87 Difference]: Start difference. First operand 1217 states and 1326 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 11:38:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:10,005 INFO L93 Difference]: Finished difference Result 1863 states and 2015 transitions. [2022-11-16 11:38:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:38:10,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 11:38:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:10,015 INFO L225 Difference]: With dead ends: 1863 [2022-11-16 11:38:10,015 INFO L226 Difference]: Without dead ends: 1863 [2022-11-16 11:38:10,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 11:38:10,016 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 754 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:10,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3733 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 11:38:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-11-16 11:38:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1461. [2022-11-16 11:38:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 899 states have (on average 1.967741935483871) internal successors, (1769), 1455 states have internal predecessors, (1769), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1785 transitions. [2022-11-16 11:38:10,050 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1785 transitions. Word has length 11 [2022-11-16 11:38:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:10,051 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 1785 transitions. [2022-11-16 11:38:10,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 11:38:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1785 transitions. [2022-11-16 11:38:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:38:10,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:10,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:10,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:10,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:10,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 518331069, now seen corresponding path program 1 times [2022-11-16 11:38:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123733186] [2022-11-16 11:38:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:10,267 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-16 11:38:10,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:10,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:10,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:10,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:38:10,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:10,490 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-16 11:38:10,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:10,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:10,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123733186] [2022-11-16 11:38:10,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123733186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:10,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:10,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:38:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279357157] [2022-11-16 11:38:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:10,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:10,493 INFO L87 Difference]: Start difference. First operand 1461 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 11:38:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:10,539 INFO L93 Difference]: Finished difference Result 1642 states and 1963 transitions. [2022-11-16 11:38:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 11:38:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:10,546 INFO L225 Difference]: With dead ends: 1642 [2022-11-16 11:38:10,546 INFO L226 Difference]: Without dead ends: 1642 [2022-11-16 11:38:10,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-16 11:38:10,548 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 602 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2068 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-16 11:38:10,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2068 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:38:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2022-11-16 11:38:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1401. [2022-11-16 11:38:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 863 states have (on average 1.9501738122827346) internal successors, (1683), 1395 states have internal predecessors, (1683), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1699 transitions. [2022-11-16 11:38:10,580 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1699 transitions. Word has length 13 [2022-11-16 11:38:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:10,580 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1699 transitions. [2022-11-16 11:38:10,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 11:38:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1699 transitions. [2022-11-16 11:38:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:38:10,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:10,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:10,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:10,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:10,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash -100024073, now seen corresponding path program 1 times [2022-11-16 11:38:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:10,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987508338] [2022-11-16 11:38:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:10,797 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-16 11:38:10,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:10,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:10,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:38:10,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:10,997 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-16 11:38:10,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:10,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:10,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987508338] [2022-11-16 11:38:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987508338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:11,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249257295] [2022-11-16 11:38:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:11,006 INFO L87 Difference]: Start difference. First operand 1401 states and 1699 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 11:38:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:11,107 INFO L93 Difference]: Finished difference Result 1614 states and 1907 transitions. [2022-11-16 11:38:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-16 11:38:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:11,113 INFO L225 Difference]: With dead ends: 1614 [2022-11-16 11:38:11,113 INFO L226 Difference]: Without dead ends: 1614 [2022-11-16 11:38:11,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-16 11:38:11,114 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 583 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 3190 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-16 11:38:11,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 3190 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:38:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-11-16 11:38:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1371. [2022-11-16 11:38:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 847 states have (on average 1.9185360094451003) internal successors, (1625), 1365 states have internal predecessors, (1625), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1641 transitions. [2022-11-16 11:38:11,145 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1641 transitions. Word has length 15 [2022-11-16 11:38:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:11,145 INFO L495 AbstractCegarLoop]: Abstraction has 1371 states and 1641 transitions. [2022-11-16 11:38:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-16 11:38:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1641 transitions. [2022-11-16 11:38:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:38:11,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:11,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:11,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:11,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:11,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr637ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1191550546, now seen corresponding path program 1 times [2022-11-16 11:38:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:11,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780764917] [2022-11-16 11:38:11,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:11,373 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-16 11:38:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:11,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:11,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:11,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:38:11,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:11,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:11,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:11,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:11,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-16 11:38:11,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:38:11,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-16 11:38:11,718 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-16 11:38:11,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:11,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:11,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780764917] [2022-11-16 11:38:11,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780764917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:11,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:11,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:11,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291343752] [2022-11-16 11:38:11,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:11,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:11,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:11,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:11,722 INFO L87 Difference]: Start difference. First operand 1371 states and 1641 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 11:38:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:13,991 INFO L93 Difference]: Finished difference Result 1825 states and 2165 transitions. [2022-11-16 11:38:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-16 11:38:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:13,997 INFO L225 Difference]: With dead ends: 1825 [2022-11-16 11:38:13,998 INFO L226 Difference]: Without dead ends: 1825 [2022-11-16 11:38:13,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-16 11:38:13,999 INFO L413 NwaCegarLoop]: 1141 mSDtfsCounter, 444 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:13,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 3301 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-16 11:38:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2022-11-16 11:38:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1370. [2022-11-16 11:38:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 846 states have (on average 1.9184397163120568) internal successors, (1623), 1364 states have internal predecessors, (1623), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1639 transitions. [2022-11-16 11:38:14,030 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1639 transitions. Word has length 16 [2022-11-16 11:38:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:14,031 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1639 transitions. [2022-11-16 11:38:14,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 11:38:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1639 transitions. [2022-11-16 11:38:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:38:14,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:14,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:14,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-16 11:38:14,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:14,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-11-16 11:38:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833288615] [2022-11-16 11:38:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:14,260 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-16 11:38:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:14,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:14,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:14,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:38:14,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:14,532 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-16 11:38:14,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:14,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:14,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833288615] [2022-11-16 11:38:14,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833288615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:14,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:14,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:38:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442874171] [2022-11-16 11:38:14,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:14,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:14,537 INFO L87 Difference]: Start difference. First operand 1370 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:14,577 INFO L93 Difference]: Finished difference Result 1310 states and 1553 transitions. [2022-11-16 11:38:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:14,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:38:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:14,584 INFO L225 Difference]: With dead ends: 1310 [2022-11-16 11:38:14,584 INFO L226 Difference]: Without dead ends: 1310 [2022-11-16 11:38:14,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:14,586 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 1104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1167 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-16 11:38:14,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1167 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:38:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-11-16 11:38:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2022-11-16 11:38:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 810 states have (on average 1.8975308641975308) internal successors, (1537), 1304 states have internal predecessors, (1537), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1553 transitions. [2022-11-16 11:38:14,617 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1553 transitions. Word has length 18 [2022-11-16 11:38:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:14,618 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1553 transitions. [2022-11-16 11:38:14,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1553 transitions. [2022-11-16 11:38:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:38:14,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:14,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:14,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:14,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:14,838 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-11-16 11:38:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:14,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368547801] [2022-11-16 11:38:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:14,840 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-16 11:38:14,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:14,841 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:14,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:15,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:38:15,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:15,129 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-16 11:38:15,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:15,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368547801] [2022-11-16 11:38:15,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368547801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:15,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:15,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397113593] [2022-11-16 11:38:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:15,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:15,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:15,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:15,133 INFO L87 Difference]: Start difference. First operand 1310 states and 1553 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:15,244 INFO L93 Difference]: Finished difference Result 1282 states and 1497 transitions. [2022-11-16 11:38:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:38:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:15,279 INFO L225 Difference]: With dead ends: 1282 [2022-11-16 11:38:15,279 INFO L226 Difference]: Without dead ends: 1282 [2022-11-16 11:38:15,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:15,281 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 1085 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2205 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-16 11:38:15,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2205 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:38:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-11-16 11:38:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1280. [2022-11-16 11:38:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 794 states have (on average 1.86272040302267) internal successors, (1479), 1274 states have internal predecessors, (1479), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1495 transitions. [2022-11-16 11:38:15,309 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1495 transitions. Word has length 20 [2022-11-16 11:38:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:15,310 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1495 transitions. [2022-11-16 11:38:15,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1495 transitions. [2022-11-16 11:38:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:38:15,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:15,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:15,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:15,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:15,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-11-16 11:38:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:15,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044618721] [2022-11-16 11:38:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:15,539 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-16 11:38:15,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:15,547 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:15,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:15,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:38:15,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:15,798 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-16 11:38:15,935 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-16 11:38:15,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:15,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:15,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044618721] [2022-11-16 11:38:15,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044618721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:15,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:15,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:38:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977190576] [2022-11-16 11:38:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:15,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:15,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:15,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:15,939 INFO L87 Difference]: Start difference. First operand 1280 states and 1495 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:19,743 INFO L93 Difference]: Finished difference Result 1879 states and 2228 transitions. [2022-11-16 11:38:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:38:19,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 11:38:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:19,752 INFO L225 Difference]: With dead ends: 1879 [2022-11-16 11:38:19,753 INFO L226 Difference]: Without dead ends: 1879 [2022-11-16 11:38:19,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:19,754 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 1764 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:19,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 1269 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-16 11:38:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-16 11:38:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1276. [2022-11-16 11:38:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 794 states have (on average 1.8526448362720402) internal successors, (1471), 1270 states have internal predecessors, (1471), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1487 transitions. [2022-11-16 11:38:19,785 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1487 transitions. Word has length 34 [2022-11-16 11:38:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:19,786 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1487 transitions. [2022-11-16 11:38:19,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1487 transitions. [2022-11-16 11:38:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:38:19,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:19,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:19,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:20,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:20,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-11-16 11:38:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:20,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962703233] [2022-11-16 11:38:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:20,004 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-16 11:38:20,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:20,008 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:20,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:20,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:38:20,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:20,290 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-16 11:38:20,537 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-16 11:38:20,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:20,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:20,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962703233] [2022-11-16 11:38:20,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962703233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:20,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:20,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:38:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549998225] [2022-11-16 11:38:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:20,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:20,540 INFO L87 Difference]: Start difference. First operand 1276 states and 1487 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:26,151 INFO L93 Difference]: Finished difference Result 2007 states and 2335 transitions. [2022-11-16 11:38:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:38:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 11:38:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:26,156 INFO L225 Difference]: With dead ends: 2007 [2022-11-16 11:38:26,156 INFO L226 Difference]: Without dead ends: 2007 [2022-11-16 11:38:26,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:26,157 INFO L413 NwaCegarLoop]: 1436 mSDtfsCounter, 1230 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:26,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 2576 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-16 11:38:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2022-11-16 11:38:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1272. [2022-11-16 11:38:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 794 states have (on average 1.8425692695214106) internal successors, (1463), 1266 states have internal predecessors, (1463), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1479 transitions. [2022-11-16 11:38:26,214 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1479 transitions. Word has length 34 [2022-11-16 11:38:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:26,214 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1479 transitions. [2022-11-16 11:38:26,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1479 transitions. [2022-11-16 11:38:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 11:38:26,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:26,220 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] [2022-11-16 11:38:26,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:26,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:26,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-11-16 11:38:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:26,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853122912] [2022-11-16 11:38:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:26,437 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-16 11:38:26,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:26,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:26,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:26,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:38:26,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:26,793 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-16 11:38:26,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:26,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853122912] [2022-11-16 11:38:26,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853122912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:26,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:26,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163145] [2022-11-16 11:38:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:26,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:26,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:26,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:26,798 INFO L87 Difference]: Start difference. First operand 1272 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-16 11:38:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:26,876 INFO L93 Difference]: Finished difference Result 1260 states and 1459 transitions. [2022-11-16 11:38:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-11-16 11:38:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:26,884 INFO L225 Difference]: With dead ends: 1260 [2022-11-16 11:38:26,884 INFO L226 Difference]: Without dead ends: 1260 [2022-11-16 11:38:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-16 11:38:26,885 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1054 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 2183 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:26,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 2183 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:38:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-11-16 11:38:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1260. [2022-11-16 11:38:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 782 states have (on average 1.8452685421994885) internal successors, (1443), 1254 states have internal predecessors, (1443), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1459 transitions. [2022-11-16 11:38:26,914 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1459 transitions. Word has length 52 [2022-11-16 11:38:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:26,914 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1459 transitions. [2022-11-16 11:38:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-16 11:38:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1459 transitions. [2022-11-16 11:38:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-16 11:38:26,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:26,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:26,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:27,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:27,132 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-11-16 11:38:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:27,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115734954] [2022-11-16 11:38:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:27,133 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-16 11:38:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:27,134 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:27,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:27,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:38:27,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:27,572 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-16 11:38:27,582 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-16 11:38:28,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:28,258 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-16 11:38:28,280 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:38:28,280 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-16 11:38:28,299 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-16 11:38:28,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:28,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:28,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115734954] [2022-11-16 11:38:28,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115734954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:28,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:28,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:38:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703827196] [2022-11-16 11:38:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:28,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:28,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:28,302 INFO L87 Difference]: Start difference. First operand 1260 states and 1459 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:32,132 INFO L93 Difference]: Finished difference Result 1608 states and 1924 transitions. [2022-11-16 11:38:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-16 11:38:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:32,140 INFO L225 Difference]: With dead ends: 1608 [2022-11-16 11:38:32,141 INFO L226 Difference]: Without dead ends: 1608 [2022-11-16 11:38:32,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:32,142 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 1807 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:32,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 791 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-16 11:38:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-11-16 11:38:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1190. [2022-11-16 11:38:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 750 states have (on average 1.7853333333333334) internal successors, (1339), 1184 states have internal predecessors, (1339), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1355 transitions. [2022-11-16 11:38:32,169 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1355 transitions. Word has length 60 [2022-11-16 11:38:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:32,169 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1355 transitions. [2022-11-16 11:38:32,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1355 transitions. [2022-11-16 11:38:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:38:32,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:32,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:32,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-16 11:38:32,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:32,388 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-11-16 11:38:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404275408] [2022-11-16 11:38:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:32,390 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-16 11:38:32,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:32,393 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:32,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 11:38:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:32,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:38:32,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:32,798 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-16 11:38:32,816 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-16 11:38:32,851 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-16 11:38:32,866 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-16 11:38:32,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:32,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404275408] [2022-11-16 11:38:32,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404275408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:32,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889045250] [2022-11-16 11:38:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:32,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:38:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:38:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:32,870 INFO L87 Difference]: Start difference. First operand 1190 states and 1355 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:36,757 INFO L93 Difference]: Finished difference Result 1189 states and 1354 transitions. [2022-11-16 11:38:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:38:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-16 11:38:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:36,762 INFO L225 Difference]: With dead ends: 1189 [2022-11-16 11:38:36,763 INFO L226 Difference]: Without dead ends: 1189 [2022-11-16 11:38:36,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:38:36,764 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 4 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:36,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2676 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-16 11:38:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-11-16 11:38:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1189. [2022-11-16 11:38:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 750 states have (on average 1.784) internal successors, (1338), 1183 states have internal predecessors, (1338), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1354 transitions. [2022-11-16 11:38:36,812 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1354 transitions. Word has length 65 [2022-11-16 11:38:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:36,813 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1354 transitions. [2022-11-16 11:38:36,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1354 transitions. [2022-11-16 11:38:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:38:36,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:36,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:36,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:37,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:37,033 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:37,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-11-16 11:38:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:37,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830331601] [2022-11-16 11:38:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:37,034 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-16 11:38:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:37,036 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:37,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-16 11:38:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:37,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:38:37,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:37,451 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-16 11:38:37,492 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-16 11:38:37,505 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-16 11:38:37,572 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-16 11:38:37,587 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-16 11:38:37,610 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-16 11:38:37,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:37,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:37,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830331601] [2022-11-16 11:38:37,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830331601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:37,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:37,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495114846] [2022-11-16 11:38:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:37,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:38:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:37,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:38:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:37,613 INFO L87 Difference]: Start difference. First operand 1189 states and 1354 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:42,673 INFO L93 Difference]: Finished difference Result 1188 states and 1353 transitions. [2022-11-16 11:38:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:38:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-16 11:38:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:42,678 INFO L225 Difference]: With dead ends: 1188 [2022-11-16 11:38:42,678 INFO L226 Difference]: Without dead ends: 1188 [2022-11-16 11:38:42,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:38:42,680 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 2 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:42,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2729 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-16 11:38:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2022-11-16 11:38:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2022-11-16 11:38:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 749 states have (on average 1.7850467289719627) internal successors, (1337), 1182 states have internal predecessors, (1337), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 11:38:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1353 transitions. [2022-11-16 11:38:42,704 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1353 transitions. Word has length 65 [2022-11-16 11:38:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:42,705 INFO L495 AbstractCegarLoop]: Abstraction has 1188 states and 1353 transitions. [2022-11-16 11:38:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1353 transitions. [2022-11-16 11:38:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:38:42,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:42,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:42,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:42,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:42,924 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1808778577, now seen corresponding path program 1 times [2022-11-16 11:38:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:42,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464153602] [2022-11-16 11:38:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:42,926 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-16 11:38:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:42,927 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:42,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:43,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:38:43,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:43,366 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-16 11:38:43,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:43,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:43,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464153602] [2022-11-16 11:38:43,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464153602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:43,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:43,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:38:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423040327] [2022-11-16 11:38:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:43,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:38:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:38:43,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:38:43,370 INFO L87 Difference]: Start difference. First operand 1188 states and 1353 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:38:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:43,427 INFO L93 Difference]: Finished difference Result 1191 states and 1357 transitions. [2022-11-16 11:38:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:38:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-11-16 11:38:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:43,433 INFO L225 Difference]: With dead ends: 1191 [2022-11-16 11:38:43,434 INFO L226 Difference]: Without dead ends: 1191 [2022-11-16 11:38:43,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:38:43,435 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 2 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3127 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-16 11:38:43,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:38:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-11-16 11:38:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2022-11-16 11:38:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 751 states have (on average 1.7842876165113182) internal successors, (1340), 1185 states have internal predecessors, (1340), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:38:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1357 transitions. [2022-11-16 11:38:43,463 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1357 transitions. Word has length 73 [2022-11-16 11:38:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:43,464 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1357 transitions. [2022-11-16 11:38:43,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:38:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1357 transitions. [2022-11-16 11:38:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:38:43,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:43,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:43,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:43,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:43,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash 483111072, now seen corresponding path program 1 times [2022-11-16 11:38:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:43,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250152117] [2022-11-16 11:38:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:43,686 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-16 11:38:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:43,688 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:43,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-16 11:38:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:44,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:38:44,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:44,191 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-16 11:38:44,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:44,297 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-16 11:38:44,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250152117] [2022-11-16 11:38:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250152117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:38:44,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 11:38:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363237157] [2022-11-16 11:38:44,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:44,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:38:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:38:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:38:44,301 INFO L87 Difference]: Start difference. First operand 1191 states and 1357 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:38:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:44,558 INFO L93 Difference]: Finished difference Result 1203 states and 1374 transitions. [2022-11-16 11:38:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:38:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-16 11:38:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:44,562 INFO L225 Difference]: With dead ends: 1203 [2022-11-16 11:38:44,562 INFO L226 Difference]: Without dead ends: 1203 [2022-11-16 11:38:44,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:38:44,563 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 21 mSDsluCounter, 3123 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:44,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:38:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-11-16 11:38:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2022-11-16 11:38:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 760 states have (on average 1.7828947368421053) internal successors, (1355), 1194 states have internal predecessors, (1355), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:38:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1372 transitions. [2022-11-16 11:38:44,587 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1372 transitions. Word has length 74 [2022-11-16 11:38:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:44,587 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 1372 transitions. [2022-11-16 11:38:44,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:38:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1372 transitions. [2022-11-16 11:38:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:38:44,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:44,589 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:44,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:44,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:44,805 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1705595153, now seen corresponding path program 2 times [2022-11-16 11:38:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:44,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278548530] [2022-11-16 11:38:44,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:38:44,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-16 11:38:44,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:44,809 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:44,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-16 11:38:45,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:38:45,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:38:45,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:38:45,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:45,579 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-16 11:38:45,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:45,885 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-16 11:38:45,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:45,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278548530] [2022-11-16 11:38:45,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278548530] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:38:45,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:45,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 11:38:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481366960] [2022-11-16 11:38:45,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:38:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:38:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:38:45,888 INFO L87 Difference]: Start difference. First operand 1201 states and 1372 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:38:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:46,859 INFO L93 Difference]: Finished difference Result 1222 states and 1400 transitions. [2022-11-16 11:38:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:38:46,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-11-16 11:38:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:46,864 INFO L225 Difference]: With dead ends: 1222 [2022-11-16 11:38:46,865 INFO L226 Difference]: Without dead ends: 1218 [2022-11-16 11:38:46,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-16 11:38:46,866 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 74 mSDsluCounter, 5223 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 6271 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:46,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 6271 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:38:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-11-16 11:38:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1210. [2022-11-16 11:38:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 769 states have (on average 1.777633289986996) internal successors, (1367), 1203 states have internal predecessors, (1367), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:38:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1384 transitions. [2022-11-16 11:38:46,893 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1384 transitions. Word has length 77 [2022-11-16 11:38:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:46,893 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1384 transitions. [2022-11-16 11:38:46,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:38:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1384 transitions. [2022-11-16 11:38:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 11:38:46,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:46,895 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:46,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:47,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:47,114 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1677221553, now seen corresponding path program 3 times [2022-11-16 11:38:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:47,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969135620] [2022-11-16 11:38:47,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:38:47,115 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-16 11:38:47,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:47,117 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:47,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:48,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 11:38:48,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:38:48,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:38:48,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:48,291 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-16 11:38:48,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:49,472 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-16 11:38:49,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:49,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969135620] [2022-11-16 11:38:49,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969135620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:38:49,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:49,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 11:38:49,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026301092] [2022-11-16 11:38:49,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:49,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:38:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:38:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:38:49,476 INFO L87 Difference]: Start difference. First operand 1210 states and 1384 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:38:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:54,439 INFO L93 Difference]: Finished difference Result 1252 states and 1446 transitions. [2022-11-16 11:38:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 11:38:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-11-16 11:38:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:54,443 INFO L225 Difference]: With dead ends: 1252 [2022-11-16 11:38:54,444 INFO L226 Difference]: Without dead ends: 1246 [2022-11-16 11:38:54,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 11:38:54,446 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 176 mSDsluCounter, 13616 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 14669 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:54,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 14669 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 11:38:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-11-16 11:38:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1228. [2022-11-16 11:38:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 787 states have (on average 1.7662007623888183) internal successors, (1390), 1221 states have internal predecessors, (1390), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:38:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1407 transitions. [2022-11-16 11:38:54,473 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1407 transitions. Word has length 83 [2022-11-16 11:38:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:54,474 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1407 transitions. [2022-11-16 11:38:54,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:38:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1407 transitions. [2022-11-16 11:38:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-16 11:38:54,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:54,476 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:54,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-16 11:38:54,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:38:54,691 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:38:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1527361039, now seen corresponding path program 4 times [2022-11-16 11:38:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:38:54,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682736963] [2022-11-16 11:38:54,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:38:54,693 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-16 11:38:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:38:54,695 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:38:54,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-16 11:38:55,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:38:55,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:38:55,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:38:55,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:55,832 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-16 11:38:55,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:58,624 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-16 11:38:58,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:38:58,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682736963] [2022-11-16 11:38:58,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682736963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:38:58,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:58,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-16 11:38:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240419998] [2022-11-16 11:38:58,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:58,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:38:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:38:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:38:58,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 11:38:58,640 INFO L87 Difference]: Start difference. First operand 1228 states and 1407 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:39:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:39:13,280 INFO L93 Difference]: Finished difference Result 1308 states and 1519 transitions. [2022-11-16 11:39:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 11:39:13,284 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-11-16 11:39:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:39:13,288 INFO L225 Difference]: With dead ends: 1308 [2022-11-16 11:39:13,288 INFO L226 Difference]: Without dead ends: 1304 [2022-11-16 11:39:13,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-16 11:39:13,293 INFO L413 NwaCegarLoop]: 1065 mSDtfsCounter, 461 mSDsluCounter, 25446 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 26511 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:39:13,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 26511 Invalid, 2795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [364 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-16 11:39:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-11-16 11:39:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1262. [2022-11-16 11:39:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 821 states have (on average 1.7490864799025578) internal successors, (1436), 1255 states have internal predecessors, (1436), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:39:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1453 transitions. [2022-11-16 11:39:13,320 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1453 transitions. Word has length 95 [2022-11-16 11:39:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:39:13,321 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1453 transitions. [2022-11-16 11:39:13,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:39:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1453 transitions. [2022-11-16 11:39:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 11:39:13,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:39:13,323 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:13,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 11:39:13,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:39:13,541 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:39:13,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1550558865, now seen corresponding path program 5 times [2022-11-16 11:39:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:39:13,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045015431] [2022-11-16 11:39:13,543 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:39:13,543 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-16 11:39:13,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:39:13,544 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:39:13,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-16 11:39:15,555 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 11:39:15,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:39:15,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-16 11:39:15,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:15,622 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-16 11:39:16,005 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:39:16,005 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-16 11:39:16,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:39:16,062 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-16 11:39:16,074 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-16 11:39:16,231 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 18 treesize of output 10 [2022-11-16 11:39:16,238 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 7 treesize of output 3 [2022-11-16 11:39:16,389 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:39:16,408 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946)))) is different from true [2022-11-16 11:39:16,576 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:16,701 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:16,817 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:16,837 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2022-11-16 11:39:16,947 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:39:17,013 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977)))) is different from true [2022-11-16 11:39:17,074 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,136 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,154 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,172 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,491 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,508 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:39:17,525 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2009))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2008) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:39:17,542 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,602 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014)))) is different from true [2022-11-16 11:39:17,707 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,823 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:39:17,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:39:17,928 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-16 11:39:17,936 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-16 11:39:17,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:39:18,001 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 25 treesize of output 13 [2022-11-16 11:39:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 665 not checked. [2022-11-16 11:39:18,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:39:19,389 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:39:19,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:39:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045015431] [2022-11-16 11:39:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045015431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [21042171] [2022-11-16 11:39:19,399 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:39:19,399 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:39:19,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:39:19,400 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:39:19,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-16 11:40:42,721 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 11:40:42,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:40:42,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 11:40:42,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:40:42,983 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-16 11:40:43,204 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:40:43,205 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-16 11:40:43,214 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-16 11:40:43,281 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-16 11:40:43,294 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-16 11:40:43,506 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-16 11:40:43,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 11:40:43,639 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:43,744 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:40:43,762 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508)))) is different from true [2022-11-16 11:40:43,779 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-11-16 11:40:43,874 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:43,938 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:43,954 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,095 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,180 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-11-16 11:40:44,196 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,212 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,230 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,298 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:40:44,356 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,371 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,386 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,400 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,520 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,537 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563)))) is different from true [2022-11-16 11:40:44,594 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,694 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,716 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,733 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-16 11:40:44,893 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:40:44,893 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-16 11:40:44,902 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-16 11:40:45,002 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-16 11:40:45,010 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-16 11:40:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2022-11-16 11:40:45,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:40:46,164 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-16 11:40:46,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [21042171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:46,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:40:46,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 33] total 56 [2022-11-16 11:40:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521770892] [2022-11-16 11:40:46,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:40:46,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 11:40:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:40:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 11:40:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=206, Unknown=57, NotChecked=3266, Total=3660 [2022-11-16 11:40:46,176 INFO L87 Difference]: Start difference. First operand 1262 states and 1453 transitions. Second operand has 57 states, 54 states have (on average 3.7777777777777777) internal successors, (204), 57 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:40:47,099 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:40:47,120 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:40:47,158 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2009))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563)))) is different from true [2022-11-16 11:40:47,182 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2009))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564))) (exists ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2026))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2027))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563)))) is different from true [2022-11-16 11:40:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:40:57,545 INFO L93 Difference]: Finished difference Result 1651 states and 1957 transitions. [2022-11-16 11:40:57,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:40:57,547 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 3.7777777777777777) internal successors, (204), 57 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2022-11-16 11:40:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:40:57,551 INFO L225 Difference]: With dead ends: 1651 [2022-11-16 11:40:57,552 INFO L226 Difference]: Without dead ends: 1647 [2022-11-16 11:40:57,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 135 SyntacticMatches, 47 SemanticMatches, 68 ConstructedPredicates, 50 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=183, Invalid=331, Unknown=66, NotChecked=4250, Total=4830 [2022-11-16 11:40:57,554 INFO L413 NwaCegarLoop]: 677 mSDtfsCounter, 1375 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3970 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 3803 SdHoareTripleChecker+Invalid, 66552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62567 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:40:57,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 3803 Invalid, 66552 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 3970 Invalid, 0 Unknown, 62567 Unchecked, 10.7s Time] [2022-11-16 11:40:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-11-16 11:40:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1261. [2022-11-16 11:40:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 821 states have (on average 1.7429963459196103) internal successors, (1431), 1254 states have internal predecessors, (1431), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:40:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1448 transitions. [2022-11-16 11:40:57,581 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1448 transitions. Word has length 117 [2022-11-16 11:40:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:40:57,582 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1448 transitions. [2022-11-16 11:40:57,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 3.7777777777777777) internal successors, (204), 57 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:40:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1448 transitions. [2022-11-16 11:40:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 11:40:57,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:40:57,584 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:40:57,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:40:57,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:40:58,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:40:58,009 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:40:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1550558866, now seen corresponding path program 1 times [2022-11-16 11:40:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:40:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761355837] [2022-11-16 11:40:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:58,012 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-16 11:40:58,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:40:58,014 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:40:58,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-16 11:40:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:58,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 11:40:59,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:40:59,011 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-16 11:40:59,217 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:40:59,217 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-16 11:40:59,255 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-16 11:40:59,413 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-16 11:40:59,843 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:01,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:01,586 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-16 11:41:01,639 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-16 11:41:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-16 11:41:01,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:02,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3139) |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-16 11:41:02,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:41:02,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761355837] [2022-11-16 11:41:02,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761355837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:02,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [116644784] [2022-11-16 11:41:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:02,117 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:41:02,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:41:02,118 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:41:02,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-16 11:41:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:04,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 11:41:04,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:04,265 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-16 11:41:04,469 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:41:04,469 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-16 11:41:04,496 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-16 11:41:04,578 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-16 11:41:04,988 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3519)))) is different from true [2022-11-16 11:41:05,153 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3523)))) is different from true [2022-11-16 11:41:05,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3526)))) is different from true [2022-11-16 11:41:05,421 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3529)))) is different from true [2022-11-16 11:41:05,551 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3532) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:05,896 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3540) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:06,746 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:06,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 36 treesize of output 37 [2022-11-16 11:41:06,797 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-16 11:41:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-16 11:41:06,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:09,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [116644784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:09,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:41:09,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 15 [2022-11-16 11:41:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87391409] [2022-11-16 11:41:09,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:41:09,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:41:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:41:09,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:41:09,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=102, Unknown=17, NotChecked=216, Total=380 [2022-11-16 11:41:09,251 INFO L87 Difference]: Start difference. First operand 1261 states and 1448 transitions. Second operand has 16 states, 14 states have (on average 6.214285714285714) internal successors, (87), 16 states have internal predecessors, (87), 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-16 11:41:09,748 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3523))) (exists ((v_ArrVal_3529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3529))) (exists ((v_ArrVal_3519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3519))) (exists ((v_ArrVal_3526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3526))) (exists ((v_ArrVal_3540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3540) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3532) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:41:15,764 INFO L93 Difference]: Finished difference Result 1646 states and 1950 transitions. [2022-11-16 11:41:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:41:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.214285714285714) internal successors, (87), 16 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-11-16 11:41:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:41:15,770 INFO L225 Difference]: With dead ends: 1646 [2022-11-16 11:41:15,770 INFO L226 Difference]: Without dead ends: 1646 [2022-11-16 11:41:15,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 139 SyntacticMatches, 83 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=66, Invalid=159, Unknown=21, NotChecked=306, Total=552 [2022-11-16 11:41:15,771 INFO L413 NwaCegarLoop]: 673 mSDtfsCounter, 722 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 13888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11934 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:41:15,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 3672 Invalid, 13888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1948 Invalid, 0 Unknown, 11934 Unchecked, 6.2s Time] [2022-11-16 11:41:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-16 11:41:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1260. [2022-11-16 11:41:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 821 states have (on average 1.7417783191230207) internal successors, (1430), 1253 states have internal predecessors, (1430), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:41:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1447 transitions. [2022-11-16 11:41:15,797 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1447 transitions. Word has length 117 [2022-11-16 11:41:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:41:15,797 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1447 transitions. [2022-11-16 11:41:15,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.214285714285714) internal successors, (87), 16 states have internal predecessors, (87), 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-16 11:41:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1447 transitions. [2022-11-16 11:41:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 11:41:15,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:41:15,800 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:15,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:41:16,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:41:16,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:41:16,213 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:41:16,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash -325619528, now seen corresponding path program 1 times [2022-11-16 11:41:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:41:16,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778549499] [2022-11-16 11:41:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:16,215 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-16 11:41:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:41:16,217 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:41:16,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:41:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:17,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 11:41:17,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:17,642 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-16 11:41:17,840 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:41:17,840 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-16 11:41:17,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:41:18,044 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-16 11:41:18,455 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3987) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:19,843 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4015) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:19,864 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4016)))) is different from true [2022-11-16 11:41:20,127 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4022)))) is different from true [2022-11-16 11:41:20,353 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:20,353 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-16 11:41:20,545 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:20,545 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-16 11:41:20,581 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-16 11:41:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-16 11:41:20,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:22,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 11:41:23,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4072))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:41:23,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:41:23,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778549499] [2022-11-16 11:41:23,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778549499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:23,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [883147416] [2022-11-16 11:41:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:23,218 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:41:23,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:41:23,219 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:41:23,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-16 11:41:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:28,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 11:41:28,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:28,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:41:28,470 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:41:28,470 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-16 11:41:28,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:41:28,568 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-16 11:41:29,065 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461)))) is different from true [2022-11-16 11:41:29,178 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464)))) is different from true [2022-11-16 11:41:29,523 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4472)))) is different from true [2022-11-16 11:41:29,590 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474)))) is different from true [2022-11-16 11:41:29,660 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:30,148 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-16 11:41:30,275 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491)))) is different from true [2022-11-16 11:41:30,567 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:30,568 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-16 11:41:30,668 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:30,669 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-16 11:41:30,702 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-16 11:41:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2022-11-16 11:41:30,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:30,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4496) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-16 11:41:30,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 11:41:31,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4542))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4496)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:41:31,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [883147416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:31,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:41:31,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 20 [2022-11-16 11:41:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847764011] [2022-11-16 11:41:31,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:41:31,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 11:41:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:41:31,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 11:41:31,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=126, Unknown=28, NotChecked=592, Total=812 [2022-11-16 11:41:31,165 INFO L87 Difference]: Start difference. First operand 1260 states and 1447 transitions. Second operand has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 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-16 11:41:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:41:38,439 INFO L93 Difference]: Finished difference Result 1645 states and 1949 transitions. [2022-11-16 11:41:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:41:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 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 120 [2022-11-16 11:41:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:41:38,444 INFO L225 Difference]: With dead ends: 1645 [2022-11-16 11:41:38,444 INFO L226 Difference]: Without dead ends: 1645 [2022-11-16 11:41:38,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 146 SyntacticMatches, 80 SemanticMatches, 30 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=85, Invalid=188, Unknown=31, NotChecked=688, Total=992 [2022-11-16 11:41:38,445 INFO L413 NwaCegarLoop]: 672 mSDtfsCounter, 724 mSDsluCounter, 3276 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 3948 SdHoareTripleChecker+Invalid, 19625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17437 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:41:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 3948 Invalid, 19625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2181 Invalid, 0 Unknown, 17437 Unchecked, 7.0s Time] [2022-11-16 11:41:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2022-11-16 11:41:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1259. [2022-11-16 11:41:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 821 states have (on average 1.7405602923264312) internal successors, (1429), 1252 states have internal predecessors, (1429), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:41:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1446 transitions. [2022-11-16 11:41:38,468 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1446 transitions. Word has length 120 [2022-11-16 11:41:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:41:38,469 INFO L495 AbstractCegarLoop]: Abstraction has 1259 states and 1446 transitions. [2022-11-16 11:41:38,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 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-16 11:41:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1446 transitions. [2022-11-16 11:41:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 11:41:38,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:41:38,471 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:38,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-11-16 11:41:38,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:41:38,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:41:38,885 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:41:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -325619527, now seen corresponding path program 1 times [2022-11-16 11:41:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:41:38,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554820057] [2022-11-16 11:41:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:38,886 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-16 11:41:38,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:41:38,887 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:41:38,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-16 11:41:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:40,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-16 11:41:40,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:40,068 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-16 11:41:40,230 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:41:40,231 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-16 11:41:40,238 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-16 11:41:40,268 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-16 11:41:40,288 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-16 11:41:40,461 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-16 11:41:40,467 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-16 11:41:40,599 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927)))) is different from true [2022-11-16 11:41:40,615 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-16 11:41:40,630 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-16 11:41:40,646 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4933))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932)))) is different from true [2022-11-16 11:41:40,661 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934)))) is different from true [2022-11-16 11:41:40,677 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:40,692 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:40,711 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941)))) is different from true [2022-11-16 11:41:40,730 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:41:40,748 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4945) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:40,764 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947)))) is different from true [2022-11-16 11:41:40,780 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949)))) is different from true [2022-11-16 11:41:40,802 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951)))) is different from true [2022-11-16 11:41:40,821 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4952))) (exists ((v_ArrVal_4953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4953)))) is different from true [2022-11-16 11:41:40,840 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:40,858 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:40,876 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4958))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4959)))) is different from true [2022-11-16 11:41:40,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4960)))) is different from true [2022-11-16 11:41:40,912 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4963) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:40,928 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:40,944 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4967) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:40,960 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968)))) is different from true [2022-11-16 11:41:40,976 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4970))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4971)))) is different from true [2022-11-16 11:41:40,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4973))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:41,048 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977)))) is different from true [2022-11-16 11:41:41,064 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:41:41,079 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981)))) is different from true [2022-11-16 11:41:41,094 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4983))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4982) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:41,110 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:41:41,125 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:41:41,140 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989)))) is different from true [2022-11-16 11:41:41,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990)))) is different from true [2022-11-16 11:41:41,172 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992)))) is different from true [2022-11-16 11:41:41,191 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994))) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995)))) is different from true [2022-11-16 11:41:41,209 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997)))) is different from true [2022-11-16 11:41:41,225 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-16 11:41:41,241 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:41:41,256 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:41,272 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:41,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006))) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:41:41,303 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-11-16 11:41:41,319 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:41:41,373 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:41,374 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-16 11:41:41,391 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-16 11:41:41,551 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:41,551 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-16 11:41:41,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:41:41,603 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-16 11:41:41,612 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-16 11:41:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-11-16 11:41:41,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:41,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-16 11:41:41,969 WARN L833 $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_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 11:41:43,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5105))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104) .cse0 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5105) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-16 11:41:43,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:41:43,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554820057] [2022-11-16 11:41:43,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554820057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:43,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [804681612] [2022-11-16 11:41:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:41:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:41:43,331 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:41:43,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-11-16 11:43:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:53,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-16 11:43:53,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:53,656 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-16 11:43:53,806 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:43:53,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 11:43:53,813 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-16 11:43:53,826 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-16 11:43:53,841 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-16 11:43:53,908 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-16 11:43:53,913 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-16 11:43:53,970 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5488) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5487) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:53,982 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5489))) (exists ((v_ArrVal_5490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5490)))) is different from true [2022-11-16 11:43:53,995 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:43:54,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5494))) (exists ((v_ArrVal_5493 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5493))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:43:54,019 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5495))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496)))) is different from true [2022-11-16 11:43:54,032 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:54,062 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502)))) is different from true [2022-11-16 11:43:54,077 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,091 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505)))) is different from true [2022-11-16 11:43:54,105 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,120 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509)))) is different from true [2022-11-16 11:43:54,134 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5512))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511)))) is different from true [2022-11-16 11:43:54,150 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5514))) (exists ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5513) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,165 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:43:54,179 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517)))) is different from true [2022-11-16 11:43:54,194 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519)))) is different from true [2022-11-16 11:43:54,209 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_ArrVal_5522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5522))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-16 11:43:54,223 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5523))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5524)))) is different from true [2022-11-16 11:43:54,238 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5526) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525)))) is different from true [2022-11-16 11:43:54,253 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:54,268 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,284 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531))) (exists ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5532) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,298 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5533) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:54,312 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536)))) is different from true [2022-11-16 11:43:54,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537)))) is different from true [2022-11-16 11:43:54,339 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,353 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542)))) is different from true [2022-11-16 11:43:54,384 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543)))) is different from true [2022-11-16 11:43:54,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5546)))) is different from true [2022-11-16 11:43:54,410 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547)))) is different from true [2022-11-16 11:43:54,423 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5550)))) is different from true [2022-11-16 11:43:54,446 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5551))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5552)))) is different from true [2022-11-16 11:43:54,461 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5553) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-16 11:43:54,476 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5556)))) is different from true [2022-11-16 11:43:54,492 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,505 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5560))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5559)))) is different from true [2022-11-16 11:43:54,518 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5562))) (exists ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5561)))) is different from true [2022-11-16 11:43:54,532 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5564)))) is different from true [2022-11-16 11:43:54,545 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5566))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5565)))) is different from true [2022-11-16 11:43:54,559 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5568))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5567)))) is different from true [2022-11-16 11:43:54,572 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:54,585 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5571) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5572) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:54,598 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5573))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5574)))) is different from true [2022-11-16 11:43:54,644 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:43:54,645 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-16 11:43:54,657 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-16 11:43:54,734 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:43:54,734 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-16 11:43:54,741 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-16 11:43:54,773 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-16 11:43:54,781 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-16 11:43:54,786 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-16 11:43:54,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:54,860 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5576 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-16 11:43:54,907 WARN L833 $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_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5576 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-16 11:43:55,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5668) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5576 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5667))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5668) .cse2 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-16 11:43:55,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [804681612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:55,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:43:55,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52] total 95 [2022-11-16 11:43:55,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836521966] [2022-11-16 11:43:55,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:43:55,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-16 11:43:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:55,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-16 11:43:55,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=190, Unknown=99, NotChecked=10212, Total=10712 [2022-11-16 11:43:55,992 INFO L87 Difference]: Start difference. First operand 1259 states and 1446 transitions. Second operand has 96 states, 94 states have (on average 1.7446808510638299) internal successors, (164), 96 states have internal predecessors, (164), 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-16 11:43:56,661 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5488) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5487) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,665 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927))) (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976))) (exists ((v_ArrVal_5489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5489))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977))) (exists ((v_ArrVal_5490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5490)))) is different from true [2022-11-16 11:43:56,669 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-16 11:43:56,673 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5494))) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_5493 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5493))) (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-16 11:43:56,677 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4933))) (exists ((v_ArrVal_5495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5495))) (exists ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4983))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932))) (exists ((v_ArrVal_4982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4982) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5496)))) is different from true [2022-11-16 11:43:56,681 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934)))) is different from true [2022-11-16 11:43:56,686 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5500) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,691 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989))) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502)))) is different from true [2022-11-16 11:43:56,696 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990))) (exists ((v_ArrVal_5503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,701 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992))) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505)))) is different from true [2022-11-16 11:43:56,706 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994))) (exists ((v_ArrVal_4945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4945) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995)))) is different from true [2022-11-16 11:43:56,711 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5510))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997))) (exists ((v_ArrVal_5509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5509)))) is different from true [2022-11-16 11:43:56,716 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5512))) (exists ((v_ArrVal_5511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5511))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-16 11:43:56,721 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951))) (exists ((v_ArrVal_5514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5514))) (exists ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5513) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,725 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4952))) (exists ((v_ArrVal_4953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4953)))) is different from true [2022-11-16 11:43:56,730 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5517))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,735 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5520))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006))) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,740 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_ArrVal_4958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4958))) (exists ((v_ArrVal_5522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5522))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4959))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-11-16 11:43:56,744 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010))) (exists ((v_ArrVal_5523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5523))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5524))) (exists ((v_ArrVal_4960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4960)))) is different from true [2022-11-16 11:43:56,749 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4962 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4962) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5526) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525)))) is different from true [2022-11-16 11:43:56,753 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,757 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4967) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,762 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531))) (exists ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5532) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,766 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4970))) (exists ((v_ArrVal_5534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5534))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5533) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4971)))) is different from true [2022-11-16 11:43:56,770 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4973))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5535))) (exists ((v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5536)))) is different from true [2022-11-16 11:43:56,775 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537)))) is different from true [2022-11-16 11:43:56,779 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927))) (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,784 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5541))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (exists ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5542)))) is different from true [2022-11-16 11:43:56,789 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543)))) is different from true [2022-11-16 11:43:56,793 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5545))) (exists ((v_ArrVal_4933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4933))) (exists ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4983))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932))) (exists ((v_ArrVal_4982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4982) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5546)))) is different from true [2022-11-16 11:43:56,798 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934)))) is different from true [2022-11-16 11:43:56,803 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5550)))) is different from true [2022-11-16 11:43:56,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5551))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_5552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5552))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989))) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,812 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-16 11:43:56,816 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5556))) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992)))) is different from true [2022-11-16 11:43:56,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994))) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4945) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995)))) is different from true [2022-11-16 11:43:56,824 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5560))) (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997))) (exists ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5559)))) is different from true [2022-11-16 11:43:56,828 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5562))) (exists ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5561))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-16 11:43:56,833 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5564))) (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951)))) is different from true [2022-11-16 11:43:56,837 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_ArrVal_5566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5566))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4952))) (exists ((v_ArrVal_4953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4953))) (exists ((v_ArrVal_5565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5565)))) is different from true [2022-11-16 11:43:56,841 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_ArrVal_5568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5568))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5567))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006))) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:56,850 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_ArrVal_4958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4958))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5571) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4959))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008))) (exists ((v_ArrVal_5572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5572) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:56,855 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5573))) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5574))) (exists ((v_ArrVal_4960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4960)))) is different from true [2022-11-16 11:43:56,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5573))) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5574)))) is different from true [2022-11-16 11:43:56,947 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927))) (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977)))) is different from true [2022-11-16 11:43:57,011 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-16 11:43:57,088 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-16 11:43:57,118 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4933))) (exists ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4983))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932))) (exists ((v_ArrVal_4982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4982) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:57,135 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934)))) is different from true [2022-11-16 11:43:57,204 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:43:57,209 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989))) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:43:57,225 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990)))) is different from true [2022-11-16 11:43:57,289 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992)))) is different from true [2022-11-16 11:43:57,294 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4944))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994))) (exists ((v_ArrVal_4945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4945) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995)))) is different from true [2022-11-16 11:43:57,310 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997)))) is different from true [2022-11-16 11:44:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:05,348 INFO L93 Difference]: Finished difference Result 1673 states and 1995 transitions. [2022-11-16 11:44:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-16 11:44:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 94 states have (on average 1.7446808510638299) internal successors, (164), 96 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 120 [2022-11-16 11:44:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:05,353 INFO L225 Difference]: With dead ends: 1673 [2022-11-16 11:44:05,353 INFO L226 Difference]: Without dead ends: 1673 [2022-11-16 11:44:05,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 165 ConstructedPredicates, 148 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=368, Invalid=404, Unknown=162, NotChecked=26788, Total=27722 [2022-11-16 11:44:05,357 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 726 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 124688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121410 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:05,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 3382 Invalid, 124688 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 3269 Invalid, 0 Unknown, 121410 Unchecked, 8.5s Time] [2022-11-16 11:44:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-11-16 11:44:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1268. [2022-11-16 11:44:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 829 states have (on average 1.7346200241254524) internal successors, (1438), 1260 states have internal predecessors, (1438), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 11:44:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1456 transitions. [2022-11-16 11:44:05,375 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1456 transitions. Word has length 120 [2022-11-16 11:44:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:05,375 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1456 transitions. [2022-11-16 11:44:05,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 94 states have (on average 1.7446808510638299) internal successors, (164), 96 states have internal predecessors, (164), 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-16 11:44:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1456 transitions. [2022-11-16 11:44:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 11:44:05,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:05,377 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:05,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-16 11:44:05,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-11-16 11:44:05,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:44:05,799 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:44:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1784266408, now seen corresponding path program 2 times [2022-11-16 11:44:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:05,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645160686] [2022-11-16 11:44:05,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:44:05,800 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-16 11:44:05,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:05,801 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:05,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-16 11:44:06,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:44:06,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:44:06,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 11:44:06,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:08,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:44:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:18,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:18,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645160686] [2022-11-16 11:44:18,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645160686] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:44:18,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:44:18,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 94 [2022-11-16 11:44:18,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570455573] [2022-11-16 11:44:18,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:44:18,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-11-16 11:44:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-11-16 11:44:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1311, Invalid=7431, Unknown=0, NotChecked=0, Total=8742 [2022-11-16 11:44:18,452 INFO L87 Difference]: Start difference. First operand 1268 states and 1456 transitions. Second operand has 94 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 94 states have internal predecessors, (167), 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-16 11:44:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:40,828 INFO L93 Difference]: Finished difference Result 1413 states and 1621 transitions. [2022-11-16 11:44:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-11-16 11:44:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 94 states have internal predecessors, (167), 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 121 [2022-11-16 11:44:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:40,832 INFO L225 Difference]: With dead ends: 1413 [2022-11-16 11:44:40,833 INFO L226 Difference]: Without dead ends: 1410 [2022-11-16 11:44:40,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=5761, Invalid=27545, Unknown=0, NotChecked=0, Total=33306 [2022-11-16 11:44:40,837 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 3043 mSDsluCounter, 51706 mSDsCounter, 0 mSdLazyCounter, 8780 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 52790 SdHoareTripleChecker+Invalid, 8911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 8780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:40,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 52790 Invalid, 8911 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [131 Valid, 8780 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2022-11-16 11:44:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-11-16 11:44:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1326. [2022-11-16 11:44:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 889 states have (on average 1.7052868391451068) internal successors, (1516), 1318 states have internal predecessors, (1516), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:44:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1533 transitions. [2022-11-16 11:44:40,873 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1533 transitions. Word has length 121 [2022-11-16 11:44:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:40,874 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1533 transitions. [2022-11-16 11:44:40,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 94 states have internal predecessors, (167), 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-16 11:44:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1533 transitions. [2022-11-16 11:44:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-16 11:44:40,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:40,876 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:40,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-16 11:44:41,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.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-16 11:44:41,104 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:44:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1800058965, now seen corresponding path program 1 times [2022-11-16 11:44:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:41,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129616185] [2022-11-16 11:44:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:41,106 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-16 11:44:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:41,107 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:41,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-16 11:44:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:42,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-16 11:44:42,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:42,300 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-16 11:44:42,460 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:44:42,460 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-16 11:44:42,493 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-16 11:44:42,632 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-16 11:44:42,850 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6447 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6447) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:44:43,312 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6460)))) is different from true [2022-11-16 11:44:44,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:44:44,362 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-16 11:44:44,478 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:44:44,479 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-16 11:44:44,591 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:44:44,592 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-16 11:44:44,618 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-16 11:44:44,665 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-16 11:44:44,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:44:46,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6489 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 11:44:46,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6489 (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~mem40#1.base| v_ArrVal_6488))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6489)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:44:46,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6489 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6488))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6489)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:44:47,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6535 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6488)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6489)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:44:47,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:47,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129616185] [2022-11-16 11:44:47,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129616185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:44:47,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1135481681] [2022-11-16 11:44:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:44:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:44:47,182 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:44:47,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-16 11:45:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:12,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 11:45:12,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:12,961 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-16 11:45:13,102 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:45:13,102 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-16 11:45:13,119 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-16 11:45:13,200 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-16 11:45:13,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6936) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:14,038 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:14,989 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:14,990 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-16 11:45:15,090 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:15,090 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-16 11:45:15,170 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:15,170 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-16 11:45:15,197 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-16 11:45:15,207 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-16 11:45:15,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:17,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6974 (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~mem40#1.base| v_ArrVal_6974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6489)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:45:17,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6974 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6489)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:45:17,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6974 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7021))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6974)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6489)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:45:17,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1135481681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:17,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:17,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-11-16 11:45:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305236195] [2022-11-16 11:45:17,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:17,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:45:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:45:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=142, Unknown=23, NotChecked=374, Total=600 [2022-11-16 11:45:17,658 INFO L87 Difference]: Start difference. First operand 1326 states and 1533 transitions. Second operand has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 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-16 11:45:18,143 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6444))) (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6460))) (exists ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6936) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6447 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6447) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:23,381 INFO L93 Difference]: Finished difference Result 1711 states and 2035 transitions. [2022-11-16 11:45:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:45:23,382 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 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 123 [2022-11-16 11:45:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:23,385 INFO L225 Difference]: With dead ends: 1711 [2022-11-16 11:45:23,385 INFO L226 Difference]: Without dead ends: 1711 [2022-11-16 11:45:23,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 154 SyntacticMatches, 87 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=82, Invalid=211, Unknown=27, NotChecked=492, Total=812 [2022-11-16 11:45:23,386 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 723 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3756 SdHoareTripleChecker+Invalid, 8340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6150 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:23,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3756 Invalid, 8340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2182 Invalid, 0 Unknown, 6150 Unchecked, 5.5s Time] [2022-11-16 11:45:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2022-11-16 11:45:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1325. [2022-11-16 11:45:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 889 states have (on average 1.704161979752531) internal successors, (1515), 1317 states have internal predecessors, (1515), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 11:45:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1532 transitions. [2022-11-16 11:45:23,403 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1532 transitions. Word has length 123 [2022-11-16 11:45:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:23,403 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1532 transitions. [2022-11-16 11:45:23,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 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-16 11:45:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1532 transitions. [2022-11-16 11:45:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-16 11:45:23,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:23,405 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:23,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:23,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:23,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:45:23,827 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-16 11:45:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1800058966, now seen corresponding path program 1 times [2022-11-16 11:45:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:23,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355196184] [2022-11-16 11:45:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:23,828 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-16 11:45:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:23,829 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:23,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-16 11:45:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-16 11:45:24,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:25,004 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-16 11:45:25,170 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:45:25,170 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-16 11:45:25,178 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-16 11:45:25,209 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-16 11:45:25,219 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-16 11:45:25,357 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-16 11:45:25,362 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-16 11:45:25,484 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7421))) (exists ((v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7420)))) is different from true [2022-11-16 11:45:25,535 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7425))) (exists ((v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7424)))) is different from true [2022-11-16 11:45:25,549 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7427))) (exists ((v_ArrVal_7426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7426)))) is different from true [2022-11-16 11:45:25,599 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7430) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7431)))) is different from true [2022-11-16 11:45:25,613 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7432))) (exists ((v_ArrVal_7433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7433)))) is different from true [2022-11-16 11:45:25,627 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7435) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7434) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:25,641 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7437))) (exists ((v_ArrVal_7436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7436) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:25,655 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7439) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7438)))) is different from true [2022-11-16 11:45:25,670 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7441) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7440)))) is different from true [2022-11-16 11:45:25,684 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7443))) (exists ((v_ArrVal_7442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7442)))) is different from true [2022-11-16 11:45:25,698 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7444))) (exists ((v_ArrVal_7445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7445)))) is different from true [2022-11-16 11:45:25,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7446))) (exists ((v_ArrVal_7447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7447)))) is different from true [2022-11-16 11:45:25,729 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7449))) (exists ((v_ArrVal_7448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7448) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:25,744 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7451))) (exists ((v_ArrVal_7450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7450) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:25,758 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7453))) (exists ((v_ArrVal_7452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7452)))) is different from true [2022-11-16 11:45:25,772 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7455))) (exists ((v_ArrVal_7454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7454)))) is different from true [2022-11-16 11:45:25,787 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7457))) (exists ((v_ArrVal_7456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7456)))) is different from true [2022-11-16 11:45:25,875 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7463))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7462)))) is different from true [2022-11-16 11:45:25,890 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7464) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7465) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:25,904 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7466))) (exists ((v_ArrVal_7467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7467) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:25,919 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7469))) (exists ((v_ArrVal_7468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7468)))) is different from true [2022-11-16 11:45:26,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7474)))) is different from true [2022-11-16 11:45:26,020 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7477))) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:26,071 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7480)))) is different from true [2022-11-16 11:45:26,085 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:26,112 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:26,127 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486)))) is different from true [2022-11-16 11:45:26,141 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488)))) is different from true [2022-11-16 11:45:26,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490))) (exists ((v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7491) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:26,170 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7493 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7493)))) is different from true [2022-11-16 11:45:26,184 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7494 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7494) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:26,198 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:26,211 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:26,223 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:45:26,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503)))) is different from true [2022-11-16 11:45:26,247 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7504) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:45:26,300 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:26,301 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-16 11:45:26,311 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-16 11:45:26,442 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:26,443 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-16 11:45:26,450 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-16 11:45:26,565 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:26,565 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-16 11:45:26,571 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-16 11:45:26,604 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-16 11:45:26,613 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-16 11:45:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-16 11:45:26,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:26,848 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:45:26,885 WARN L833 $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_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 11:45:28,517 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (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|) .cse2))) (and (forall ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7506))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7507) .cse1 v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7507) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-16 11:45:30,565 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7600))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7506))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7601) .cse0 v_ArrVal_7507) .cse1 v_ArrVal_7509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7600))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7601) .cse6 v_ArrVal_7507) (select (select (store .cse7 .cse6 v_ArrVal_7506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7509))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-16 11:45:30,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355196184] [2022-11-16 11:45:30,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355196184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [978111279] [2022-11-16 11:45:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:45:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:45:30,581 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:45:30,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12d80c5-ab2b-44d9-8cb1-15e38c65eb17/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-16 11:46:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:31,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-16 11:46:31,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:31,187 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-16 11:46:31,360 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-16 11:46:31,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:46:31,379 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-16 11:46:31,393 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-16 11:46:31,404 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-16 11:46:31,486 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-16 11:46:31,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 11:46:31,568 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7998))) (exists ((v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7999)))) is different from true [2022-11-16 11:46:31,584 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8000) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8001)))) is different from true [2022-11-16 11:46:31,600 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8002) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:31,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8004))) (exists ((v_ArrVal_8005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8005)))) is different from true [2022-11-16 11:46:31,632 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8007))) (exists ((v_ArrVal_8006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8006)))) is different from true [2022-11-16 11:46:31,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8009))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8008)))) is different from true [2022-11-16 11:46:31,664 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8011))) (exists ((v_ArrVal_8010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8010)))) is different from true [2022-11-16 11:46:31,680 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8012))) (exists ((v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8013) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:31,697 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8015))) (exists ((v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8014)))) is different from true [2022-11-16 11:46:31,713 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8017) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8016) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:31,729 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8018)))) is different from true [2022-11-16 11:46:31,785 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8023))) (exists ((v_ArrVal_8022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8022) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:31,841 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8027))) (exists ((v_ArrVal_8026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8026) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:31,856 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8028))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8029)))) is different from true [2022-11-16 11:46:31,913 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8032) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8033)))) is different from true [2022-11-16 11:46:31,928 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8034) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8035)))) is different from true [2022-11-16 11:46:31,944 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8036))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8037) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:31,960 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8038))) (exists ((v_ArrVal_8039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8039)))) is different from true [2022-11-16 11:46:31,977 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8040) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8041) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:31,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8043) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8042)))) is different from true [2022-11-16 11:46:32,009 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8044) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,024 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8047))) (exists ((v_ArrVal_8046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8046) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,040 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8049)))) is different from true [2022-11-16 11:46:32,056 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8050))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8051) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:32,072 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8053))) (exists ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8052) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,089 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8054))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8055) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:32,104 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8057))) (exists ((v_ArrVal_8056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8056) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,121 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8059))) (exists ((v_ArrVal_8058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8058)))) is different from true [2022-11-16 11:46:32,136 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8060)))) is different from true [2022-11-16 11:46:32,152 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8063) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8062) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,186 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8065))) (exists ((v_ArrVal_8064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8064) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:46:32,202 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8067))) (exists ((v_ArrVal_8066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8066)))) is different from true [2022-11-16 11:46:32,217 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8068))) (exists ((v_ArrVal_8069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8069) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,234 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8070))) (exists ((v_ArrVal_8071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8071)))) is different from true [2022-11-16 11:46:32,250 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8073))) (exists ((v_ArrVal_8072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8072) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,266 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8074))) (exists ((v_ArrVal_8075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8075)))) is different from true [2022-11-16 11:46:32,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8077 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8077) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8076 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8076) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,299 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8078) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8079) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,315 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8081) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8080) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,332 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8083))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8082) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:32,348 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8085 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8085) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8084)))) is different from true [2022-11-16 11:46:32,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:46:32,402 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-16 11:46:32,409 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-16 11:46:32,509 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:46:32,509 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-16 11:46:32,524 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-16 11:46:32,592 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:46:32,592 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-16 11:46:32,607 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-16 11:46:32,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:46:32,651 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-16 11:46:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-11-16 11:46:32,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:32,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8088 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:46:32,771 WARN L833 $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_8089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8088 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 11:46:32,829 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8087))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8086) .cse0 v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8086) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-16 11:46:32,876 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (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|) .cse2))) (and (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8087))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8086) .cse1 v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8086) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-16 11:46:33,939 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8180))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8181) .cse1 v_ArrVal_8086) (select (select (store .cse2 .cse1 v_ArrVal_8087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8089))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8180))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8087))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8181) .cse4 v_ArrVal_8086) .cse5 v_ArrVal_8089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-16 11:46:33,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [978111279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:33,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:33,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 51] total 87 [2022-11-16 11:46:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423688238] [2022-11-16 11:46:33,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-16 11:46:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:46:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-16 11:46:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=215, Unknown=105, NotChecked=9374, Total=9900 [2022-11-16 11:46:33,960 INFO L87 Difference]: Start difference. First operand 1325 states and 1532 transitions. Second operand has 88 states, 86 states have (on average 1.930232558139535) internal successors, (166), 88 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:46:35,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7998))) (exists ((v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7418))) (exists ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7419) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7999)))) is different from true [2022-11-16 11:46:35,868 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7463))) (exists ((v_ArrVal_7430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7474))) (exists ((v_ArrVal_7425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7425))) (exists ((v_ArrVal_7480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7480))) (exists ((v_ArrVal_8032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8032) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7418))) (exists ((v_ArrVal_7462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7462))) (exists ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7419) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8023))) (exists ((v_ArrVal_8027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8027))) (exists ((v_ArrVal_7431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7431))) (exists ((v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7421))) (exists ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8000) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8001))) (exists ((v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7424))) (exists ((v_ArrVal_8022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8022) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8033))) (exists ((v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7420)))) is different from true [2022-11-16 11:46:35,908 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7463))) (exists ((v_ArrVal_8036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8036))) (exists ((v_ArrVal_7430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_8034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8034) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8028))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7474))) (exists ((v_ArrVal_7477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7477))) (exists ((v_ArrVal_7425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7425))) (exists ((v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7435) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7480))) (exists ((v_ArrVal_7464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7464) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8032) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8004))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7418))) (exists ((v_ArrVal_7462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7462))) (exists ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7419) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8037) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8023))) (exists ((v_ArrVal_8029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8029))) (exists ((v_ArrVal_8005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8005))) (exists ((v_ArrVal_8027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8027))) (exists ((v_ArrVal_7431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7431))) (exists ((v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7421))) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8035))) (exists ((v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7424))) (exists ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7427))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8022) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7434) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7465) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7466))) (exists ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8033))) (exists ((v_ArrVal_7432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7432))) (exists ((v_ArrVal_7426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7426))) (exists ((v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7420))) (exists ((v_ArrVal_7467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7467) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7433)))) is different from true [2022-11-16 11:46:35,919 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7463))) (exists ((v_ArrVal_8036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8036))) (exists ((v_ArrVal_7430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_8034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8034) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8028))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_8007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8007))) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7474))) (exists ((v_ArrVal_7469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7469))) (exists ((v_ArrVal_7477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7477))) (exists ((v_ArrVal_7425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7425))) (exists ((v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7435) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7468))) (exists ((v_ArrVal_7480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7480))) (exists ((v_ArrVal_7464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7464) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8006))) (exists ((v_ArrVal_8038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8038))) (exists ((v_ArrVal_8032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8032) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8039))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7418))) (exists ((v_ArrVal_7437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7437))) (exists ((v_ArrVal_7462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7462))) (exists ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7419) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8037) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8023))) (exists ((v_ArrVal_8029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8029))) (exists ((v_ArrVal_8027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8027))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7431))) (exists ((v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7421))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486))) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8035))) (exists ((v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7424))) (exists ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7427))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8022) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7436) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7434) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7465) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7466))) (exists ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8033))) (exists ((v_ArrVal_7432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7432))) (exists ((v_ArrVal_7426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7426))) (exists ((v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7420))) (exists ((v_ArrVal_7467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7467) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7433)))) is different from true [2022-11-16 11:46:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:49,313 INFO L93 Difference]: Finished difference Result 1711 states and 2035 transitions. [2022-11-16 11:46:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:46:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 86 states have (on average 1.930232558139535) internal successors, (166), 88 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 123 [2022-11-16 11:46:49,314 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-16 11:46:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 86 states have (on average 1.930232558139535) internal successors, (166), 88 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 123