./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:14:05,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:14:05,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:14:05,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:14:05,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:14:05,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:14:05,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:14:05,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:14:05,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:14:05,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:14:05,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:14:05,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:14:05,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:14:05,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:14:05,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:14:05,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:14:05,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:14:05,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:14:05,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:14:05,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:14:05,647 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:14:05,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:14:05,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:14:05,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:14:05,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:14:05,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:14:05,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:14:05,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:14:05,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:14:05,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:14:05,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:14:05,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:14:05,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:14:05,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:14:05,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:14:05,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:14:05,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:14:05,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:14:05,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:14:05,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:14:05,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:14:05,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:14:05,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 13:14:05,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:14:05,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:14:05,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:14:05,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:14:05,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:14:05,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:14:05,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:14:05,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:14:05,690 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:14:05,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:14:05,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:14:05,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:14:05,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:14:05,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:14:05,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:14:05,692 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 13:14:05,692 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 13:14:05,692 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 13:14:05,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:14:05,694 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 13:14:05,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:14:05,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:14:05,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:14:05,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:14:05,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:14:05,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:14:05,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:14:05,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:14:05,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:14:05,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:14:05,696 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2022-07-14 13:14:05,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:14:05,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:14:05,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:14:05,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:14:05,928 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:14:05,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2022-07-14 13:14:05,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78842eda8/a0e7626a7fb748e1a8e7b89d91e0ca0d/FLAGa4494c3fc [2022-07-14 13:14:06,453 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:14:06,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2022-07-14 13:14:06,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78842eda8/a0e7626a7fb748e1a8e7b89d91e0ca0d/FLAGa4494c3fc [2022-07-14 13:14:06,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78842eda8/a0e7626a7fb748e1a8e7b89d91e0ca0d [2022-07-14 13:14:06,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:14:06,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:14:06,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:14:06,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:14:06,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:14:06,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:14:06" (1/1) ... [2022-07-14 13:14:06,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba2a66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:06, skipping insertion in model container [2022-07-14 13:14:06,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:14:06" (1/1) ... [2022-07-14 13:14:06,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:14:07,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:14:07,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[37019,37032] [2022-07-14 13:14:07,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[47352,47365] [2022-07-14 13:14:07,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:14:07,403 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-07-14 13:14:07,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79401bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:07, skipping insertion in model container [2022-07-14 13:14:07,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:14:07,405 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 13:14:07,407 INFO L158 Benchmark]: Toolchain (without parser) took 448.69ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 57.3MB in the beginning and 94.6MB in the end (delta: -37.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 13:14:07,408 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 48.9MB in the beginning and 48.9MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:14:07,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.69ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 57.2MB in the beginning and 94.6MB in the end (delta: -37.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 13:14:07,411 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.15ms. Allocated memory is still 92.3MB. Free memory was 48.9MB in the beginning and 48.9MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.69ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 57.2MB in the beginning and 94.6MB in the end (delta: -37.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:14:08,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:14:08,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:14:08,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:14:08,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:14:08,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:14:08,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:14:08,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:14:08,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:14:08,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:14:08,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:14:08,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:14:08,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:14:08,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:14:08,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:14:08,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:14:08,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:14:08,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:14:08,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:14:08,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:14:08,958 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:14:08,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:14:08,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:14:08,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:14:08,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:14:08,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:14:08,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:14:08,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:14:08,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:14:08,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:14:08,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:14:08,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:14:08,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:14:08,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:14:08,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:14:08,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:14:08,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:14:08,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:14:08,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:14:08,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:14:08,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:14:08,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:14:08,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 13:14:09,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:14:09,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:14:09,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:14:09,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:14:09,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:14:09,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:14:09,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:14:09,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:14:09,010 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:14:09,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:14:09,011 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:14:09,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:14:09,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:14:09,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:14:09,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:14:09,012 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 13:14:09,012 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 13:14:09,013 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 13:14:09,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:14:09,013 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 13:14:09,013 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 13:14:09,013 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 13:14:09,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:14:09,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:14:09,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:14:09,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:14:09,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:14:09,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:14:09,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:14:09,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:14:09,015 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 13:14:09,015 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 13:14:09,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 13:14:09,015 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2022-07-14 13:14:09,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:14:09,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:14:09,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:14:09,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:14:09,307 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:14:09,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2022-07-14 13:14:09,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657d36847/f6ed89b6d6714d9a99cf38d66cee8870/FLAG1adf0da8f [2022-07-14 13:14:09,810 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:14:09,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2022-07-14 13:14:09,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657d36847/f6ed89b6d6714d9a99cf38d66cee8870/FLAG1adf0da8f [2022-07-14 13:14:10,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657d36847/f6ed89b6d6714d9a99cf38d66cee8870 [2022-07-14 13:14:10,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:14:10,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:14:10,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:14:10,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:14:10,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:14:10,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:10,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533074db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10, skipping insertion in model container [2022-07-14 13:14:10,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:10,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:14:10,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:14:10,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[37019,37032] [2022-07-14 13:14:10,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[47352,47365] [2022-07-14 13:14:10,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:14:10,748 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 13:14:10,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:14:10,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[37019,37032] [2022-07-14 13:14:10,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[47352,47365] [2022-07-14 13:14:10,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:14:10,846 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:14:10,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[37019,37032] [2022-07-14 13:14:10,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i[47352,47365] [2022-07-14 13:14:10,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:14:10,945 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:14:10,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10 WrapperNode [2022-07-14 13:14:10,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:14:10,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:14:10,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:14:10,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:14:10,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:10,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,024 INFO L137 Inliner]: procedures = 211, calls = 286, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1054 [2022-07-14 13:14:11,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:14:11,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:14:11,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:14:11,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:14:11,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:14:11,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:14:11,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:14:11,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:14:11,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (1/1) ... [2022-07-14 13:14:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:14:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:14:11,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 13:14:11,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 13:14:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 13:14:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 13:14:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 13:14:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 13:14:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 13:14:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 13:14:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:14:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 13:14:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:14:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:14:11,416 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:14:11,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:14:11,420 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 13:14:14,524 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:14:14,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:14:14,533 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-07-14 13:14:14,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:14:14 BoogieIcfgContainer [2022-07-14 13:14:14,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:14:14,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:14:14,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:14:14,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:14:14,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:14:10" (1/3) ... [2022-07-14 13:14:14,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d710d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:14:14, skipping insertion in model container [2022-07-14 13:14:14,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:14:10" (2/3) ... [2022-07-14 13:14:14,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d710d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:14:14, skipping insertion in model container [2022-07-14 13:14:14,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:14:14" (3/3) ... [2022-07-14 13:14:14,541 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-2.i [2022-07-14 13:14:14,550 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:14:14,551 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-07-14 13:14:14,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:14:14,603 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@622aeb3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c5658a [2022-07-14 13:14:14,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-07-14 13:14:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 1081 states, 537 states have (on average 2.2364990689013036) internal successors, (1201), 1075 states have internal predecessors, (1201), 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-07-14 13:14:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 13:14:14,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:14,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 13:14:14,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-07-14 13:14:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:14,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914880543] [2022-07-14 13:14:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:14,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:14,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 13:14:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:14,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:14:14,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:14,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:14,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:14,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:14,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914880543] [2022-07-14 13:14:14,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914880543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:14,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:14,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:14:14,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273767080] [2022-07-14 13:14:14,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:14,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:14,906 INFO L87 Difference]: Start difference. First operand has 1081 states, 537 states have (on average 2.2364990689013036) internal successors, (1201), 1075 states have internal predecessors, (1201), 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-07-14 13:14:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:16,345 INFO L93 Difference]: Finished difference Result 1245 states and 1321 transitions. [2022-07-14 13:14:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:16,347 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-07-14 13:14:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:16,359 INFO L225 Difference]: With dead ends: 1245 [2022-07-14 13:14:16,360 INFO L226 Difference]: Without dead ends: 1243 [2022-07-14 13:14:16,361 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-07-14 13:14:16,363 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 995 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:16,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 805 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-14 13:14:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-07-14 13:14:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1065. [2022-07-14 13:14:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 537 states have (on average 2.080074487895717) internal successors, (1117), 1059 states have internal predecessors, (1117), 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-07-14 13:14:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1133 transitions. [2022-07-14 13:14:16,421 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1133 transitions. Word has length 3 [2022-07-14 13:14:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:16,421 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1133 transitions. [2022-07-14 13:14:16,421 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-07-14 13:14:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1133 transitions. [2022-07-14 13:14:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 13:14:16,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:16,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 13:14:16,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:16,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:16,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-07-14 13:14:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:16,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130400083] [2022-07-14 13:14:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:16,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:16,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 13:14:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:16,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:14:16,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:16,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:16,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:16,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130400083] [2022-07-14 13:14:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130400083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:16,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:16,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:14:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464733847] [2022-07-14 13:14:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:16,754 INFO L87 Difference]: Start difference. First operand 1065 states and 1133 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-07-14 13:14:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:18,700 INFO L93 Difference]: Finished difference Result 1483 states and 1593 transitions. [2022-07-14 13:14:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:18,701 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-07-14 13:14:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:18,708 INFO L225 Difference]: With dead ends: 1483 [2022-07-14 13:14:18,708 INFO L226 Difference]: Without dead ends: 1483 [2022-07-14 13:14:18,709 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-07-14 13:14:18,710 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 450 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:18,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1540 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-14 13:14:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-07-14 13:14:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1197. [2022-07-14 13:14:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 665 states have (on average 2.037593984962406) internal successors, (1355), 1191 states have internal predecessors, (1355), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1381 transitions. [2022-07-14 13:14:18,732 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1381 transitions. Word has length 3 [2022-07-14 13:14:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:18,733 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1381 transitions. [2022-07-14 13:14:18,733 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-07-14 13:14:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1381 transitions. [2022-07-14 13:14:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 13:14:18,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:18,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:18,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:18,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:18,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-07-14 13:14:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:18,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604914735] [2022-07-14 13:14:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:18,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:18,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:18,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:18,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 13:14:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:19,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:14:19,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:19,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:19,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:19,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 13:14:19,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:19,129 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:14:19,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 12 [2022-07-14 13:14:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:19,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:19,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:19,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604914735] [2022-07-14 13:14:19,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604914735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:19,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:19,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:19,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917033383] [2022-07-14 13:14:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:19,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:19,150 INFO L87 Difference]: Start difference. First operand 1197 states and 1381 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-07-14 13:14:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:21,188 INFO L93 Difference]: Finished difference Result 1364 states and 1556 transitions. [2022-07-14 13:14:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:14:21,189 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-07-14 13:14:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:21,193 INFO L225 Difference]: With dead ends: 1364 [2022-07-14 13:14:21,193 INFO L226 Difference]: Without dead ends: 1364 [2022-07-14 13:14:21,194 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-07-14 13:14:21,194 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 1267 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:21,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 473 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 13:14:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-14 13:14:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1054. [2022-07-14 13:14:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 537 states have (on average 2.0577281191806334) internal successors, (1105), 1048 states have internal predecessors, (1105), 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-07-14 13:14:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1121 transitions. [2022-07-14 13:14:21,214 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1121 transitions. Word has length 7 [2022-07-14 13:14:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:21,214 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1121 transitions. [2022-07-14 13:14:21,215 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-07-14 13:14:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1121 transitions. [2022-07-14 13:14:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 13:14:21,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:21,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:21,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-14 13:14:21,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:21,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-07-14 13:14:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:21,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40433475] [2022-07-14 13:14:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:21,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:21,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 13:14:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:21,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:14:21,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:21,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:21,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:21,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:21,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40433475] [2022-07-14 13:14:21,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40433475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:21,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:21,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:14:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460267565] [2022-07-14 13:14:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:21,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:21,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:21,538 INFO L87 Difference]: Start difference. First operand 1054 states and 1121 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-07-14 13:14:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:22,748 INFO L93 Difference]: Finished difference Result 1230 states and 1328 transitions. [2022-07-14 13:14:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:22,749 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-07-14 13:14:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:22,753 INFO L225 Difference]: With dead ends: 1230 [2022-07-14 13:14:22,753 INFO L226 Difference]: Without dead ends: 1230 [2022-07-14 13:14:22,754 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-07-14 13:14:22,754 INFO L413 NwaCegarLoop]: 906 mSDtfsCounter, 814 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:22,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1183 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 13:14:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-07-14 13:14:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1007. [2022-07-14 13:14:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 537 states have (on average 1.9702048417132216) internal successors, (1058), 1001 states have internal predecessors, (1058), 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-07-14 13:14:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1074 transitions. [2022-07-14 13:14:22,768 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1074 transitions. Word has length 8 [2022-07-14 13:14:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:22,769 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1074 transitions. [2022-07-14 13:14:22,769 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-07-14 13:14:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1074 transitions. [2022-07-14 13:14:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 13:14:22,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:22,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:22,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 13:14:22,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:22,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-07-14 13:14:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:22,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953044957] [2022-07-14 13:14:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:22,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:22,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:22,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 13:14:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:23,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:14:23,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:23,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:23,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:23,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:23,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953044957] [2022-07-14 13:14:23,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953044957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:23,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:23,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:14:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022165989] [2022-07-14 13:14:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:23,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:23,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:23,100 INFO L87 Difference]: Start difference. First operand 1007 states and 1074 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-07-14 13:14:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:24,657 INFO L93 Difference]: Finished difference Result 1295 states and 1396 transitions. [2022-07-14 13:14:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:24,658 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-07-14 13:14:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:24,661 INFO L225 Difference]: With dead ends: 1295 [2022-07-14 13:14:24,661 INFO L226 Difference]: Without dead ends: 1295 [2022-07-14 13:14:24,661 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-07-14 13:14:24,662 INFO L413 NwaCegarLoop]: 1098 mSDtfsCounter, 499 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:24,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1541 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 13:14:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-07-14 13:14:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1029. [2022-07-14 13:14:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 569 states have (on average 1.9578207381370827) internal successors, (1114), 1023 states have internal predecessors, (1114), 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-07-14 13:14:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1130 transitions. [2022-07-14 13:14:24,684 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1130 transitions. Word has length 8 [2022-07-14 13:14:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:24,684 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1130 transitions. [2022-07-14 13:14:24,684 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-07-14 13:14:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1130 transitions. [2022-07-14 13:14:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 13:14:24,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:24,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:24,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:24,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:24,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 871160987, now seen corresponding path program 1 times [2022-07-14 13:14:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:24,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646126820] [2022-07-14 13:14:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:24,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 13:14:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:24,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:14:24,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:25,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:25,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646126820] [2022-07-14 13:14:25,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646126820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:25,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:25,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615566743] [2022-07-14 13:14:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:25,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:25,037 INFO L87 Difference]: Start difference. First operand 1029 states and 1130 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:14:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:25,211 INFO L93 Difference]: Finished difference Result 1506 states and 1652 transitions. [2022-07-14 13:14:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:25,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 13:14:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:25,216 INFO L225 Difference]: With dead ends: 1506 [2022-07-14 13:14:25,216 INFO L226 Difference]: Without dead ends: 1506 [2022-07-14 13:14:25,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:25,217 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 570 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:25,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 2038 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:14:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2022-07-14 13:14:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1213. [2022-07-14 13:14:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 748 states have (on average 1.8997326203208555) internal successors, (1421), 1207 states have internal predecessors, (1421), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1447 transitions. [2022-07-14 13:14:25,243 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1447 transitions. Word has length 11 [2022-07-14 13:14:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:25,243 INFO L495 AbstractCegarLoop]: Abstraction has 1213 states and 1447 transitions. [2022-07-14 13:14:25,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:14:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1447 transitions. [2022-07-14 13:14:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 13:14:25,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:25,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:25,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:25,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:25,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-07-14 13:14:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:25,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027344406] [2022-07-14 13:14:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:25,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:25,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:25,454 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:25,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 13:14:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:25,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 13:14:25,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:25,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:25,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:25,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027344406] [2022-07-14 13:14:25,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027344406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:25,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:25,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974393327] [2022-07-14 13:14:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:25,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:25,566 INFO L87 Difference]: Start difference. First operand 1213 states and 1447 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-07-14 13:14:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:25,584 INFO L93 Difference]: Finished difference Result 1367 states and 1587 transitions. [2022-07-14 13:14:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:25,584 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-07-14 13:14:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:25,588 INFO L225 Difference]: With dead ends: 1367 [2022-07-14 13:14:25,588 INFO L226 Difference]: Without dead ends: 1367 [2022-07-14 13:14:25,588 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-07-14 13:14:25,589 INFO L413 NwaCegarLoop]: 1222 mSDtfsCounter, 404 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2044 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-07-14 13:14:25,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2044 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:14:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-14 13:14:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1153. [2022-07-14 13:14:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 712 states have (on average 1.875) internal successors, (1335), 1147 states have internal predecessors, (1335), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1361 transitions. [2022-07-14 13:14:25,610 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1361 transitions. Word has length 13 [2022-07-14 13:14:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:25,610 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1361 transitions. [2022-07-14 13:14:25,610 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-07-14 13:14:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1361 transitions. [2022-07-14 13:14:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 13:14:25,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:25,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:25,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:25,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:25,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1723272146, now seen corresponding path program 1 times [2022-07-14 13:14:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:25,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308245961] [2022-07-14 13:14:25,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:25,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:25,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:25,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 13:14:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:25,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:14:25,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:25,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 13:14:25,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 13:14:25,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 13:14:26,023 INFO L356 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2022-07-14 13:14:26,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 30 treesize of output 36 [2022-07-14 13:14:26,058 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-14 13:14:26,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 23 [2022-07-14 13:14:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:26,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:26,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308245961] [2022-07-14 13:14:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308245961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:26,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:26,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:14:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183814172] [2022-07-14 13:14:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:26,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:26,070 INFO L87 Difference]: Start difference. First operand 1153 states and 1361 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-07-14 13:14:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:26,913 INFO L93 Difference]: Finished difference Result 1490 states and 1749 transitions. [2022-07-14 13:14:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:14:26,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-14 13:14:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:26,917 INFO L225 Difference]: With dead ends: 1490 [2022-07-14 13:14:26,917 INFO L226 Difference]: Without dead ends: 1490 [2022-07-14 13:14:26,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-07-14 13:14:26,917 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 342 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:26,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 2835 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 13:14:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-14 13:14:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1152. [2022-07-14 13:14:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 711 states have (on average 1.8748241912798875) internal successors, (1333), 1146 states have internal predecessors, (1333), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1359 transitions. [2022-07-14 13:14:26,942 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1359 transitions. Word has length 14 [2022-07-14 13:14:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:26,942 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 1359 transitions. [2022-07-14 13:14:26,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-07-14 13:14:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1359 transitions. [2022-07-14 13:14:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 13:14:26,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:26,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:26,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:27,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:27,151 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-07-14 13:14:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:27,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601508414] [2022-07-14 13:14:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:27,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:27,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:27,153 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:27,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 13:14:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:27,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 13:14:27,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:27,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:27,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:27,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601508414] [2022-07-14 13:14:27,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601508414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:27,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:27,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184980010] [2022-07-14 13:14:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:27,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:14:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:14:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:14:27,285 INFO L87 Difference]: Start difference. First operand 1152 states and 1359 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-07-14 13:14:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:27,301 INFO L93 Difference]: Finished difference Result 1092 states and 1273 transitions. [2022-07-14 13:14:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:14:27,302 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-07-14 13:14:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:27,304 INFO L225 Difference]: With dead ends: 1092 [2022-07-14 13:14:27,304 INFO L226 Difference]: Without dead ends: 1092 [2022-07-14 13:14:27,304 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-07-14 13:14:27,305 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 943 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1006 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-07-14 13:14:27,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1006 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:14:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-07-14 13:14:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2022-07-14 13:14:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 675 states have (on average 1.8474074074074074) internal successors, (1247), 1086 states have internal predecessors, (1247), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1273 transitions. [2022-07-14 13:14:27,317 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1273 transitions. Word has length 18 [2022-07-14 13:14:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:27,317 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 1273 transitions. [2022-07-14 13:14:27,317 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-07-14 13:14:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1273 transitions. [2022-07-14 13:14:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:14:27,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:27,318 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-07-14 13:14:27,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:27,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:27,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-07-14 13:14:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:27,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751944143] [2022-07-14 13:14:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:27,526 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:27,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 13:14:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:27,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:14:27,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:27,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:27,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:27,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751944143] [2022-07-14 13:14:27,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751944143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:27,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:27,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:14:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468945853] [2022-07-14 13:14:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:27,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:27,658 INFO L87 Difference]: Start difference. First operand 1092 states and 1273 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-07-14 13:14:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:27,702 INFO L93 Difference]: Finished difference Result 1064 states and 1217 transitions. [2022-07-14 13:14:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:14:27,702 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-07-14 13:14:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:27,705 INFO L225 Difference]: With dead ends: 1064 [2022-07-14 13:14:27,705 INFO L226 Difference]: Without dead ends: 1064 [2022-07-14 13:14:27,705 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-07-14 13:14:27,705 INFO L413 NwaCegarLoop]: 929 mSDtfsCounter, 914 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:27,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1883 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:14:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-07-14 13:14:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1062. [2022-07-14 13:14:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 659 states have (on average 1.8042488619119879) internal successors, (1189), 1056 states have internal predecessors, (1189), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1215 transitions. [2022-07-14 13:14:27,717 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1215 transitions. Word has length 20 [2022-07-14 13:14:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:27,717 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1215 transitions. [2022-07-14 13:14:27,717 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-07-14 13:14:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1215 transitions. [2022-07-14 13:14:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 13:14:27,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:27,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:14:27,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:27,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:27,931 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-07-14 13:14:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:27,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480154284] [2022-07-14 13:14:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:27,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:27,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:27,934 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:27,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 13:14:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:28,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:14:28,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:28,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:28,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:28,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480154284] [2022-07-14 13:14:28,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480154284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:28,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:28,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468754174] [2022-07-14 13:14:28,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:28,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:28,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:28,121 INFO L87 Difference]: Start difference. First operand 1062 states and 1215 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-07-14 13:14:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:29,493 INFO L93 Difference]: Finished difference Result 1513 states and 1751 transitions. [2022-07-14 13:14:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:14:29,493 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-07-14 13:14:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:29,497 INFO L225 Difference]: With dead ends: 1513 [2022-07-14 13:14:29,497 INFO L226 Difference]: Without dead ends: 1513 [2022-07-14 13:14:29,497 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-07-14 13:14:29,498 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 1462 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:29,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 1057 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 13:14:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2022-07-14 13:14:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1058. [2022-07-14 13:14:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 659 states have (on average 1.7921092564491654) internal successors, (1181), 1052 states have internal predecessors, (1181), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1207 transitions. [2022-07-14 13:14:29,509 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1207 transitions. Word has length 34 [2022-07-14 13:14:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:29,510 INFO L495 AbstractCegarLoop]: Abstraction has 1058 states and 1207 transitions. [2022-07-14 13:14:29,510 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-07-14 13:14:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1207 transitions. [2022-07-14 13:14:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 13:14:29,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:29,510 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-07-14 13:14:29,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:29,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:29,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-07-14 13:14:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:29,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2996464] [2022-07-14 13:14:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:29,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:29,720 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:29,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 13:14:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:29,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:14:29,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:29,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:29,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:29,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:29,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2996464] [2022-07-14 13:14:29,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2996464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:29,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:29,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775517933] [2022-07-14 13:14:29,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:29,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:29,970 INFO L87 Difference]: Start difference. First operand 1058 states and 1207 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-07-14 13:14:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:32,183 INFO L93 Difference]: Finished difference Result 1570 states and 1773 transitions. [2022-07-14 13:14:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:14:32,184 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-07-14 13:14:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:32,187 INFO L225 Difference]: With dead ends: 1570 [2022-07-14 13:14:32,187 INFO L226 Difference]: Without dead ends: 1570 [2022-07-14 13:14:32,187 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-07-14 13:14:32,188 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 928 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:32,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 2162 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 13:14:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-07-14 13:14:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1054. [2022-07-14 13:14:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 659 states have (on average 1.779969650986343) internal successors, (1173), 1048 states have internal predecessors, (1173), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1199 transitions. [2022-07-14 13:14:32,200 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1199 transitions. Word has length 34 [2022-07-14 13:14:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:32,200 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1199 transitions. [2022-07-14 13:14:32,200 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-07-14 13:14:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1199 transitions. [2022-07-14 13:14:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 13:14:32,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:32,201 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-07-14 13:14:32,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:32,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:32,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-07-14 13:14:32,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:32,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722527422] [2022-07-14 13:14:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:32,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:32,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:32,411 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:32,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 13:14:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:32,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:14:32,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:32,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:32,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722527422] [2022-07-14 13:14:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722527422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:32,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:32,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:14:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449038540] [2022-07-14 13:14:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:32,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:32,629 INFO L87 Difference]: Start difference. First operand 1054 states and 1199 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-07-14 13:14:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:32,668 INFO L93 Difference]: Finished difference Result 1042 states and 1179 transitions. [2022-07-14 13:14:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:14:32,669 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-07-14 13:14:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:32,672 INFO L225 Difference]: With dead ends: 1042 [2022-07-14 13:14:32,673 INFO L226 Difference]: Without dead ends: 1042 [2022-07-14 13:14:32,673 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-07-14 13:14:32,674 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 890 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:32,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1861 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:14:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-07-14 13:14:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-07-14 13:14:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 647 states have (on average 1.7820710973724885) internal successors, (1153), 1036 states have internal predecessors, (1153), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1179 transitions. [2022-07-14 13:14:32,686 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1179 transitions. Word has length 52 [2022-07-14 13:14:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:32,688 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1179 transitions. [2022-07-14 13:14:32,688 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-07-14 13:14:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1179 transitions. [2022-07-14 13:14:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-14 13:14:32,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:32,692 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-07-14 13:14:32,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:32,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:32,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-07-14 13:14:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:32,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252509934] [2022-07-14 13:14:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:32,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:32,902 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:32,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 13:14:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:33,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:14:33,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:33,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:33,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:33,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 13:14:33,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:33,504 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:14:33,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-14 13:14:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:33,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:33,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:33,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252509934] [2022-07-14 13:14:33,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252509934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:33,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:33,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:14:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336849210] [2022-07-14 13:14:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:33,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:33,514 INFO L87 Difference]: Start difference. First operand 1042 states and 1179 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-07-14 13:14:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:34,999 INFO L93 Difference]: Finished difference Result 1264 states and 1480 transitions. [2022-07-14 13:14:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:14:34,999 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-07-14 13:14:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:35,002 INFO L225 Difference]: With dead ends: 1264 [2022-07-14 13:14:35,003 INFO L226 Difference]: Without dead ends: 1264 [2022-07-14 13:14:35,003 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-07-14 13:14:35,003 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 843 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:35,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 758 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 13:14:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-07-14 13:14:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 972. [2022-07-14 13:14:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 615 states have (on average 1.7056910569105692) internal successors, (1049), 966 states have internal predecessors, (1049), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1075 transitions. [2022-07-14 13:14:35,013 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1075 transitions. Word has length 60 [2022-07-14 13:14:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:35,014 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1075 transitions. [2022-07-14 13:14:35,014 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-07-14 13:14:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1075 transitions. [2022-07-14 13:14:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 13:14:35,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:35,014 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-07-14 13:14:35,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:35,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:35,227 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-07-14 13:14:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:35,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440534803] [2022-07-14 13:14:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:35,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:35,229 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:35,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 13:14:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:35,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:14:35,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:35,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:35,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:35,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:35,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:35,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440534803] [2022-07-14 13:14:35,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440534803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:35,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:35,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:14:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861713861] [2022-07-14 13:14:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:35,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:14:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:14:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:14:35,485 INFO L87 Difference]: Start difference. First operand 972 states and 1075 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-07-14 13:14:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:36,988 INFO L93 Difference]: Finished difference Result 971 states and 1074 transitions. [2022-07-14 13:14:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 13:14:36,989 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-07-14 13:14:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:36,991 INFO L225 Difference]: With dead ends: 971 [2022-07-14 13:14:36,991 INFO L226 Difference]: Without dead ends: 971 [2022-07-14 13:14:36,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:14:36,992 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 4 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:36,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2294 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 13:14:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-07-14 13:14:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2022-07-14 13:14:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 615 states have (on average 1.7040650406504065) internal successors, (1048), 965 states have internal predecessors, (1048), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1074 transitions. [2022-07-14 13:14:37,000 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1074 transitions. Word has length 65 [2022-07-14 13:14:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:37,001 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 1074 transitions. [2022-07-14 13:14:37,001 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-07-14 13:14:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1074 transitions. [2022-07-14 13:14:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-14 13:14:37,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:37,002 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-07-14 13:14:37,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:37,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:37,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-07-14 13:14:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:37,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570592806] [2022-07-14 13:14:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:37,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:37,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:37,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 13:14:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:37,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 13:14:37,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:37,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:37,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:37,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:37,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:37,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:37,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:37,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:37,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570592806] [2022-07-14 13:14:37,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570592806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:37,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:37,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:14:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722314610] [2022-07-14 13:14:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:37,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:14:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:14:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:14:37,513 INFO L87 Difference]: Start difference. First operand 971 states and 1074 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-07-14 13:14:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:39,449 INFO L93 Difference]: Finished difference Result 970 states and 1073 transitions. [2022-07-14 13:14:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 13:14:39,449 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-07-14 13:14:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:39,452 INFO L225 Difference]: With dead ends: 970 [2022-07-14 13:14:39,452 INFO L226 Difference]: Without dead ends: 970 [2022-07-14 13:14:39,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:14:39,452 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:39,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2330 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-14 13:14:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-07-14 13:14:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-07-14 13:14:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 614 states have (on average 1.705211726384365) internal successors, (1047), 964 states have internal predecessors, (1047), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 13:14:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1073 transitions. [2022-07-14 13:14:39,461 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1073 transitions. Word has length 65 [2022-07-14 13:14:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:39,462 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1073 transitions. [2022-07-14 13:14:39,462 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-07-14 13:14:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1073 transitions. [2022-07-14 13:14:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 13:14:39,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:39,463 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-07-14 13:14:39,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:39,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:39,672 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 864578415, now seen corresponding path program 1 times [2022-07-14 13:14:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:39,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722558561] [2022-07-14 13:14:39,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:39,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:39,692 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:39,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 13:14:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:39,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:14:39,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:39,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:14:39,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722558561] [2022-07-14 13:14:39,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722558561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:14:39,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:14:39,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:14:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331941677] [2022-07-14 13:14:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:14:39,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:14:39,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:39,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:14:39,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:14:39,938 INFO L87 Difference]: Start difference. First operand 970 states and 1073 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-07-14 13:14:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:39,974 INFO L93 Difference]: Finished difference Result 973 states and 1077 transitions. [2022-07-14 13:14:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:14:39,975 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-07-14 13:14:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:39,980 INFO L225 Difference]: With dead ends: 973 [2022-07-14 13:14:39,981 INFO L226 Difference]: Without dead ends: 973 [2022-07-14 13:14:39,981 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-07-14 13:14:39,981 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 2 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2644 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-07-14 13:14:39,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2644 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:14:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-07-14 13:14:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2022-07-14 13:14:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 616 states have (on average 1.7045454545454546) internal successors, (1050), 967 states have internal predecessors, (1050), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:14:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1077 transitions. [2022-07-14 13:14:40,002 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1077 transitions. Word has length 73 [2022-07-14 13:14:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:40,003 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1077 transitions. [2022-07-14 13:14:40,003 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-07-14 13:14:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1077 transitions. [2022-07-14 13:14:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 13:14:40,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:40,004 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-07-14 13:14:40,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:40,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:40,215 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1994106300, now seen corresponding path program 1 times [2022-07-14 13:14:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:40,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257410931] [2022-07-14 13:14:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:14:40,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:40,217 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:40,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 13:14:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:14:40,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:14:40,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:40,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:14:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:40,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257410931] [2022-07-14 13:14:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257410931] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:14:40,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:14:40,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 13:14:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570094094] [2022-07-14 13:14:40,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:14:40,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 13:14:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 13:14:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:14:40,535 INFO L87 Difference]: Start difference. First operand 973 states and 1077 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-07-14 13:14:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:40,654 INFO L93 Difference]: Finished difference Result 985 states and 1094 transitions. [2022-07-14 13:14:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 13:14:40,654 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-07-14 13:14:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:40,657 INFO L225 Difference]: With dead ends: 985 [2022-07-14 13:14:40,657 INFO L226 Difference]: Without dead ends: 985 [2022-07-14 13:14:40,657 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-07-14 13:14:40,657 INFO L413 NwaCegarLoop]: 884 mSDtfsCounter, 12 mSDsluCounter, 4396 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5280 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:40,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5280 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:14:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-07-14 13:14:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 983. [2022-07-14 13:14:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 625 states have (on average 1.704) internal successors, (1065), 976 states have internal predecessors, (1065), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:14:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1092 transitions. [2022-07-14 13:14:40,667 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1092 transitions. Word has length 74 [2022-07-14 13:14:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:40,667 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1092 transitions. [2022-07-14 13:14:40,667 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-07-14 13:14:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1092 transitions. [2022-07-14 13:14:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-14 13:14:40,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:40,668 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-07-14 13:14:40,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:40,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:40,887 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 195761839, now seen corresponding path program 2 times [2022-07-14 13:14:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:40,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980969138] [2022-07-14 13:14:40,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:14:40,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:40,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:40,889 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:40,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 13:14:41,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:14:41,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:14:41,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:14:41,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:41,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:14:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:41,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:41,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980969138] [2022-07-14 13:14:41,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980969138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:14:41,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:14:41,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-14 13:14:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346798687] [2022-07-14 13:14:41,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:14:41,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 13:14:41,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 13:14:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:14:41,515 INFO L87 Difference]: Start difference. First operand 983 states and 1092 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-07-14 13:14:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:41,984 INFO L93 Difference]: Finished difference Result 1004 states and 1120 transitions. [2022-07-14 13:14:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 13:14:41,985 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-07-14 13:14:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:41,987 INFO L225 Difference]: With dead ends: 1004 [2022-07-14 13:14:41,987 INFO L226 Difference]: Without dead ends: 1000 [2022-07-14 13:14:41,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-14 13:14:41,988 INFO L413 NwaCegarLoop]: 887 mSDtfsCounter, 58 mSDsluCounter, 5296 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6183 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:41,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 6183 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:14:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-07-14 13:14:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 992. [2022-07-14 13:14:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 634 states have (on average 1.6987381703470033) internal successors, (1077), 985 states have internal predecessors, (1077), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:14:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1104 transitions. [2022-07-14 13:14:41,998 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1104 transitions. Word has length 77 [2022-07-14 13:14:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:41,998 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1104 transitions. [2022-07-14 13:14:41,998 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-07-14 13:14:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1104 transitions. [2022-07-14 13:14:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:14:41,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:41,999 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-07-14 13:14:42,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:42,210 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1311126641, now seen corresponding path program 3 times [2022-07-14 13:14:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:42,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817142833] [2022-07-14 13:14:42,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:14:42,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:42,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:42,212 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:42,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 13:14:42,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 13:14:42,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:14:42,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 13:14:42,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:42,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:14:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:43,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:43,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817142833] [2022-07-14 13:14:43,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817142833] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:14:43,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:14:43,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-14 13:14:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578832712] [2022-07-14 13:14:43,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:14:43,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 13:14:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 13:14:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 13:14:43,498 INFO L87 Difference]: Start difference. First operand 992 states and 1104 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-07-14 13:14:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:45,937 INFO L93 Difference]: Finished difference Result 1034 states and 1166 transitions. [2022-07-14 13:14:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 13:14:45,938 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-07-14 13:14:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:45,941 INFO L225 Difference]: With dead ends: 1034 [2022-07-14 13:14:45,941 INFO L226 Difference]: Without dead ends: 1028 [2022-07-14 13:14:45,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 13:14:45,942 INFO L413 NwaCegarLoop]: 892 mSDtfsCounter, 196 mSDsluCounter, 9769 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 10661 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:45,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 10661 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 13:14:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-07-14 13:14:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1010. [2022-07-14 13:14:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 652 states have (on average 1.687116564417178) internal successors, (1100), 1003 states have internal predecessors, (1100), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:14:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1127 transitions. [2022-07-14 13:14:45,952 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1127 transitions. Word has length 83 [2022-07-14 13:14:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:45,952 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1127 transitions. [2022-07-14 13:14:45,953 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-07-14 13:14:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1127 transitions. [2022-07-14 13:14:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-14 13:14:45,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:45,953 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-07-14 13:14:45,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:46,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:46,165 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1292614991, now seen corresponding path program 4 times [2022-07-14 13:14:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:46,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913610331] [2022-07-14 13:14:46,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 13:14:46,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:46,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:46,167 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:46,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 13:14:46,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 13:14:46,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:14:46,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 13:14:46,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:46,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:14:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:14:48,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:14:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913610331] [2022-07-14 13:14:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913610331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:14:48,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:14:48,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-14 13:14:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469352782] [2022-07-14 13:14:48,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:14:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 13:14:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:14:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 13:14:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 13:14:48,104 INFO L87 Difference]: Start difference. First operand 1010 states and 1127 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-07-14 13:14:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:14:57,960 INFO L93 Difference]: Finished difference Result 1090 states and 1239 transitions. [2022-07-14 13:14:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-14 13:14:57,961 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-07-14 13:14:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:14:57,963 INFO L225 Difference]: With dead ends: 1090 [2022-07-14 13:14:57,963 INFO L226 Difference]: Without dead ends: 1086 [2022-07-14 13:14:57,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-14 13:14:57,968 INFO L413 NwaCegarLoop]: 904 mSDtfsCounter, 535 mSDsluCounter, 20704 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 21608 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:14:57,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 21608 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 13:14:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2022-07-14 13:14:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1044. [2022-07-14 13:14:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 686 states have (on average 1.6705539358600583) internal successors, (1146), 1037 states have internal predecessors, (1146), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:14:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1173 transitions. [2022-07-14 13:14:57,985 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1173 transitions. Word has length 95 [2022-07-14 13:14:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:14:57,986 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 1173 transitions. [2022-07-14 13:14:57,986 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-07-14 13:14:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1173 transitions. [2022-07-14 13:14:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 13:14:57,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:14:57,987 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-07-14 13:14:57,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 13:14:58,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:14:58,199 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:14:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:14:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1355651281, now seen corresponding path program 5 times [2022-07-14 13:14:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:14:58,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441271654] [2022-07-14 13:14:58,200 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 13:14:58,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:14:58,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:14:58,201 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:14:58,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 13:14:59,405 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 13:14:59,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:14:59,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-14 13:14:59,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:14:59,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:59,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:59,533 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:14:59,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-14 13:14:59,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:59,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:59,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:59,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:14:59,680 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,738 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_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:14:59,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,766 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,775 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:14:59,786 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,825 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927)))) is different from true [2022-07-14 13:14:59,834 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:14:59,842 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,854 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932)))) is different from true [2022-07-14 13:14:59,886 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,897 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,953 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-07-14 13:14:59,980 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,987 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:14:59,994 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:15:00,002 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:15:00,038 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-07-14 13:15:00,082 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-07-14 13:15:00,129 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:15:00,136 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-07-14 13:15:00,161 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977)))) is different from true [2022-07-14 13:15:00,185 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-07-14 13:15:00,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:15:00,219 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986)))) is different from true [2022-07-14 13:15:00,228 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-07-14 13:15:00,236 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:15:00,243 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:15:00,251 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:15:00,300 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:15:00,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:15:00,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:15:00,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:15:00,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:15:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2022-07-14 13:15:00,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:15:01,017 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |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_2089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-14 13:15:01,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:15:01,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441271654] [2022-07-14 13:15:01,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441271654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:15:01,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [797316428] [2022-07-14 13:15:01,023 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 13:15:01,023 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 13:15:01,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 13:15:01,024 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 13:15:01,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-14 13:16:31,985 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 13:16:31,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:16:32,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-14 13:16:32,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:32,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,287 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:16:32,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-14 13:16:32,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,394 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,419 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,484 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,492 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,499 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:16:32,529 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,541 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-14 13:16:32,549 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,556 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,564 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,572 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,580 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496)))) is different from true [2022-07-14 13:16:32,588 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,595 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-07-14 13:16:32,603 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,611 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,620 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-07-14 13:16:32,627 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-07-14 13:16:32,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:16:32,642 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,650 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,658 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,665 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,673 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,682 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-07-14 13:16:32,691 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,717 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-14 13:16:32,725 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-07-14 13:16:32,734 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,742 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-07-14 13:16:32,750 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-14 13:16:32,757 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:16:32,766 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-07-14 13:16:32,791 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-07-14 13:16:32,799 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,806 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:32,813 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-07-14 13:16:32,820 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-07-14 13:16:32,857 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:32,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 969 not checked. [2022-07-14 13:16:32,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:33,411 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |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_2643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-14 13:16:33,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [797316428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:33,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:33,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 46] total 75 [2022-07-14 13:16:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526708448] [2022-07-14 13:16:33,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:33,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-14 13:16:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:33,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-14 13:16:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=148, Unknown=77, NotChecked=5934, Total=6320 [2022-07-14 13:16:33,417 INFO L87 Difference]: Start difference. First operand 1044 states and 1173 transitions. Second operand has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 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-07-14 13:16:33,745 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (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_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (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_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_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_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (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_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (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_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (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_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_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (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_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_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_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (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_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_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_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (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_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,766 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (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_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (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_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (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_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_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_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (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_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (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_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (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_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (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_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,777 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (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_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (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_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (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_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (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_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (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_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (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_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (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_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (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_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |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_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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_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_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (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_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (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_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,788 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (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_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (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_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (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_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (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_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (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_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (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_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (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_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (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_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (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_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |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_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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_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_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (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_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (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_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,799 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (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_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (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_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (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_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (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_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (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_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (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_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (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_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (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_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (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_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |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_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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_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_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (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_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (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_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,811 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (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_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (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_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (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_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (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_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_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (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_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (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_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (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_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (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_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (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_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (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_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920) |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_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_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_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_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (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_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (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_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (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_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-14 13:16:33,863 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_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |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_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-14 13:16:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:36,709 INFO L93 Difference]: Finished difference Result 1316 states and 1529 transitions. [2022-07-14 13:16:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 13:16:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 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 117 [2022-07-14 13:16:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:36,713 INFO L225 Difference]: With dead ends: 1316 [2022-07-14 13:16:36,713 INFO L226 Difference]: Without dead ends: 1312 [2022-07-14 13:16:36,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 138 SyntacticMatches, 26 SemanticMatches, 92 ConstructedPredicates, 77 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=274, Unknown=91, NotChecked=8162, Total=8742 [2022-07-14 13:16:36,716 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 584 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 63519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61434 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:36,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 2421 Invalid, 63519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2077 Invalid, 0 Unknown, 61434 Unchecked, 2.9s Time] [2022-07-14 13:16:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-07-14 13:16:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1043. [2022-07-14 13:16:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 686 states have (on average 1.663265306122449) internal successors, (1141), 1036 states have internal predecessors, (1141), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:16:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1168 transitions. [2022-07-14 13:16:36,730 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1168 transitions. Word has length 117 [2022-07-14 13:16:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:36,730 INFO L495 AbstractCegarLoop]: Abstraction has 1043 states and 1168 transitions. [2022-07-14 13:16:36,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 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-07-14 13:16:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1168 transitions. [2022-07-14 13:16:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 13:16:36,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:36,732 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-07-14 13:16:36,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-07-14 13:16:36,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-14 13:16:37,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:37,150 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:16:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1355651282, now seen corresponding path program 1 times [2022-07-14 13:16:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229095036] [2022-07-14 13:16:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:37,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:37,152 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:37,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 13:16:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:37,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 13:16:37,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:37,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:37,950 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 13:16:37,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 24 [2022-07-14 13:16:37,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:38,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:38,133 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3019) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:38,169 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3021)))) is different from true [2022-07-14 13:16:38,181 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3022)))) is different from true [2022-07-14 13:16:38,275 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:38,429 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035)))) is different from true [2022-07-14 13:16:38,438 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3036) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:38,479 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:38,705 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-07-14 13:16:38,715 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (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)))) is different from true [2022-07-14 13:16:38,768 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053)))) is different from true [2022-07-14 13:16:38,879 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058)))) is different from true [2022-07-14 13:16:38,979 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:38,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 13:16:39,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 429 not checked. [2022-07-14 13:16:39,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:39,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:39,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229095036] [2022-07-14 13:16:39,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229095036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:39,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1609776333] [2022-07-14 13:16:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:39,244 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 13:16:39,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 13:16:39,245 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 13:16:39,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-14 13:16:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:41,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-14 13:16:41,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:41,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:41,240 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 13:16:41,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 24 [2022-07-14 13:16:41,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:41,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:41,344 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:41,353 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:41,401 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:41,455 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3488)))) is different from true [2022-07-14 13:16:41,529 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3492)))) is different from true [2022-07-14 13:16:41,657 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3498) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:41,890 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3510)))) is different from true [2022-07-14 13:16:42,050 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3518)))) is different from true [2022-07-14 13:16:42,215 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:42,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 13:16:42,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-07-14 13:16:42,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:42,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3570) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))) is different from false [2022-07-14 13:16:42,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1609776333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:42,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 27 [2022-07-14 13:16:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810671605] [2022-07-14 13:16:42,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 13:16:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 13:16:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=112, Unknown=31, NotChecked=780, Total=992 [2022-07-14 13:16:42,419 INFO L87 Difference]: Start difference. First operand 1043 states and 1168 transitions. Second operand has 28 states, 26 states have (on average 4.115384615384615) internal successors, (107), 28 states have internal predecessors, (107), 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-07-14 13:16:42,582 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 (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3492))) (exists ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3488))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3018))) (exists ((v_ArrVal_3518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3518))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3021))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3510))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-07-14 13:16:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:44,034 INFO L93 Difference]: Finished difference Result 1303 states and 1508 transitions. [2022-07-14 13:16:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 13:16:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.115384615384615) internal successors, (107), 28 states have internal predecessors, (107), 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-07-14 13:16:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:44,037 INFO L225 Difference]: With dead ends: 1303 [2022-07-14 13:16:44,037 INFO L226 Difference]: Without dead ends: 1303 [2022-07-14 13:16:44,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 137 SyntacticMatches, 75 SemanticMatches, 33 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=148, Unknown=34, NotChecked=924, Total=1190 [2022-07-14 13:16:44,038 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 581 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 23804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22695 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:44,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 2692 Invalid, 23804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1103 Invalid, 0 Unknown, 22695 Unchecked, 1.5s Time] [2022-07-14 13:16:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2022-07-14 13:16:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1042. [2022-07-14 13:16:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 686 states have (on average 1.661807580174927) internal successors, (1140), 1035 states have internal predecessors, (1140), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:16:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1167 transitions. [2022-07-14 13:16:44,050 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1167 transitions. Word has length 117 [2022-07-14 13:16:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:44,050 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1167 transitions. [2022-07-14 13:16:44,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.115384615384615) internal successors, (107), 28 states have internal predecessors, (107), 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-07-14 13:16:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1167 transitions. [2022-07-14 13:16:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 13:16:44,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:44,051 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-07-14 13:16:44,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:44,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-14 13:16:44,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 13:16:44,464 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:16:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -629568776, now seen corresponding path program 1 times [2022-07-14 13:16:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:44,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115027189] [2022-07-14 13:16:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:44,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:44,466 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:44,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 13:16:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:45,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 13:16:45,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:45,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:45,319 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 13:16:45,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 24 [2022-07-14 13:16:45,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:45,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:45,850 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 (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (select |c_#valid| v_arrayElimCell_42) (_ bv1 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:46,152 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 (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (select |c_#valid| v_arrayElimCell_42) (_ bv1 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3986)))) is different from true [2022-07-14 13:16:46,340 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:46,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 13:16:46,402 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:46,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 13:16:46,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-07-14 13:16:46,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:46,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2022-07-14 13:16:46,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_4040))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3994)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-14 13:16:46,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:46,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115027189] [2022-07-14 13:16:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115027189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:46,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [692291330] [2022-07-14 13:16:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:46,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 13:16:46,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 13:16:46,687 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 13:16:46,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-14 13:16:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:49,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 13:16:49,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:49,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:49,788 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 13:16:49,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 24 [2022-07-14 13:16:49,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:49,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:50,521 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 (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (select |c_#valid| v_arrayElimCell_42) (_ bv1 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450)))) is different from true [2022-07-14 13:16:50,814 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:50,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 13:16:50,852 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:50,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-14 13:16:50,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-07-14 13:16:50,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:51,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_4510))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3994)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-14 13:16:51,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [692291330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:51,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:51,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-14 13:16:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264131938] [2022-07-14 13:16:51,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:51,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 13:16:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 13:16:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=117, Unknown=17, NotChecked=162, Total=342 [2022-07-14 13:16:51,083 INFO L87 Difference]: Start difference. First operand 1042 states and 1167 transitions. Second operand has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 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-07-14 13:16:51,275 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (select |c_#valid| v_arrayElimCell_42) (_ bv1 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3986)))) is different from true [2022-07-14 13:16:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:52,987 INFO L93 Difference]: Finished difference Result 1301 states and 1505 transitions. [2022-07-14 13:16:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 13:16:52,988 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 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-07-14 13:16:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:52,991 INFO L225 Difference]: With dead ends: 1301 [2022-07-14 13:16:52,991 INFO L226 Difference]: Without dead ends: 1301 [2022-07-14 13:16:52,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 144 SyntacticMatches, 91 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=61, Invalid=157, Unknown=20, NotChecked=224, Total=462 [2022-07-14 13:16:52,992 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 577 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 5671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4299 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:52,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 2771 Invalid, 5671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1365 Invalid, 0 Unknown, 4299 Unchecked, 1.8s Time] [2022-07-14 13:16:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-07-14 13:16:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1041. [2022-07-14 13:16:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 686 states have (on average 1.6603498542274053) internal successors, (1139), 1034 states have internal predecessors, (1139), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 13:16:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1166 transitions. [2022-07-14 13:16:53,004 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1166 transitions. Word has length 120 [2022-07-14 13:16:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:53,004 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1166 transitions. [2022-07-14 13:16:53,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 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-07-14 13:16:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1166 transitions. [2022-07-14 13:16:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 13:16:53,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:53,005 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-07-14 13:16:53,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:53,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:53,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:53,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-14 13:16:53,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash -629568775, now seen corresponding path program 1 times [2022-07-14 13:16:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:53,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263407291] [2022-07-14 13:16:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:53,430 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:53,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 13:16:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:54,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-14 13:16:54,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:54,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:54,397 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:16:54,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-14 13:16:54,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:54,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:54,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:54,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:54,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:54,520 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_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:54,568 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4899))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4898) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:54,576 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4901) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4900) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:16:54,601 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-07-14 13:16:54,649 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_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:54,656 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4913))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912)))) is different from true [2022-07-14 13:16:54,663 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_4915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4915) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4914)))) is different from true [2022-07-14 13:16:54,669 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:54,690 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_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:16:54,698 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920)))) is different from true [2022-07-14 13:16:54,726 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)))) is different from true [2022-07-14 13:16:54,734 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-07-14 13:16:54,759 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-07-14 13:16:54,824 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-07-14 13:16:54,831 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-07-14 13:16:54,911 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4951) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4950)))) is different from true [2022-07-14 13:16:54,918 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-07-14 13:16:54,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4959)))) is different from true [2022-07-14 13:16:54,989 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-07-14 13:16:54,995 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-07-14 13:16:55,002 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_4967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966)))) is different from true [2022-07-14 13:16:55,028 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-07-14 13:16:55,046 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-07-14 13:16:55,054 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_4975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4975))) (exists ((v_ArrVal_4974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4974)))) is different from true [2022-07-14 13:16:55,061 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4976) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4977 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4977) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:16:55,119 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:55,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:55,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:55,195 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:55,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:55,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:55,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:55,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-14 13:16:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2022-07-14 13:16:55,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:55,364 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4981) |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_4980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2022-07-14 13:16:55,389 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2022-07-14 13:16:55,988 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5073) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5072)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5073) .cse2 v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_4980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2022-07-14 13:16:55,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:55,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263407291] [2022-07-14 13:16:55,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263407291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:55,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [307784820] [2022-07-14 13:16:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 13:16:55,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 13:16:56,000 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 13:16:56,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process