./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/memsafety-ext2/complex_data_creation_test01-1.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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:57:58,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:57:58,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:57:58,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:57:58,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:57:58,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:57:58,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:57:58,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:57:58,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:57:58,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:57:58,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:57:58,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:57:58,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:57:58,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:57:58,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:57:58,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:57:58,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:57:58,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:57:58,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:57:58,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:57:58,260 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:57:58,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:57:58,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:57:58,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:57:58,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:57:58,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:57:58,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:57:58,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:57:58,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:57:58,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:57:58,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:57:58,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:57:58,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:57:58,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:57:58,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:57:58,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:57:58,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:57:58,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:57:58,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:57:58,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:57:58,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:57:58,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:57:58,283 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:57:58,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:57:58,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:57:58,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:57:58,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:57:58,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:57:58,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:57:58,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:57:58,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:57:58,313 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:57:58,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:57:58,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:57:58,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:57:58,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:57:58,315 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:57:58,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:57:58,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:57:58,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:57:58,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:57:58,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:57:58,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:57:58,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:57:58,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:57:58,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:57:58,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:57:58,316 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-07-23 05:57:58,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:57:58,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:57:58,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:57:58,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:57:58,587 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:57:58,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-07-23 05:57:58,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7a8b6a5/b2d3849d1327407986787b67974d79ff/FLAG92fad88cb [2022-07-23 05:57:59,089 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:57:59,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-07-23 05:57:59,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7a8b6a5/b2d3849d1327407986787b67974d79ff/FLAG92fad88cb [2022-07-23 05:57:59,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7a8b6a5/b2d3849d1327407986787b67974d79ff [2022-07-23 05:57:59,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:57:59,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:57:59,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:57:59,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:57:59,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:57:59,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:57:59" (1/1) ... [2022-07-23 05:57:59,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a4cf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:59, skipping insertion in model container [2022-07-23 05:57:59,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:57:59" (1/1) ... [2022-07-23 05:57:59,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:57:59,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:57:59,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:57:59,975 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-23 05:57:59,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a69c026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:59, skipping insertion in model container [2022-07-23 05:57:59,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:57:59,977 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 05:57:59,979 INFO L158 Benchmark]: Toolchain (without parser) took 359.52ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 42.3MB in the beginning and 80.1MB in the end (delta: -37.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-07-23 05:57:59,980 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 05:57:59,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.02ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 42.1MB in the beginning and 80.1MB in the end (delta: -38.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-07-23 05:57:59,984 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.21ms. Allocated memory is still 81.8MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.02ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 42.1MB in the beginning and 80.1MB in the end (delta: -38.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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/memsafety-ext2/complex_data_creation_test01-1.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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:58:01,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:58:01,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:58:01,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:58:01,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:58:01,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:58:01,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:58:01,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:58:01,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:58:01,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:58:01,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:58:01,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:58:01,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:58:01,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:58:01,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:58:01,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:58:01,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:58:01,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:58:01,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:58:01,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:58:01,985 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:58:01,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:58:01,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:58:01,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:58:01,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:58:01,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:58:01,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:58:01,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:58:01,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:58:01,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:58:01,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:58:01,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:58:02,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:58:02,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:58:02,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:58:02,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:58:02,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:58:02,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:58:02,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:58:02,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:58:02,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:58:02,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:58:02,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 05:58:02,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:58:02,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:58:02,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:58:02,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:58:02,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:58:02,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:58:02,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:58:02,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:58:02,048 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:58:02,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:58:02,049 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:58:02,049 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:58:02,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:58:02,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:58:02,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:58:02,050 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:58:02,050 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:58:02,050 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:58:02,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:58:02,050 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:58:02,050 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 05:58:02,051 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 05:58:02,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:58:02,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:58:02,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:58:02,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:58:02,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:58:02,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:58:02,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:58:02,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:58:02,053 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 05:58:02,053 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 05:58:02,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 05:58:02,053 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-07-23 05:58:02,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:58:02,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:58:02,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:58:02,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:58:02,407 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:58:02,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-07-23 05:58:02,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f566e1f/114684f46d374d1a86a0140aa0aaacfe/FLAG57904cf2a [2022-07-23 05:58:03,003 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:58:03,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-07-23 05:58:03,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f566e1f/114684f46d374d1a86a0140aa0aaacfe/FLAG57904cf2a [2022-07-23 05:58:03,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f566e1f/114684f46d374d1a86a0140aa0aaacfe [2022-07-23 05:58:03,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:58:03,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:58:03,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:58:03,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:58:03,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:58:03,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606082e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03, skipping insertion in model container [2022-07-23 05:58:03,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:58:03,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:58:03,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:03,690 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 05:58:03,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:58:03,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:03,739 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:58:03,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:03,805 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:58:03,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03 WrapperNode [2022-07-23 05:58:03,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:58:03,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:58:03,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:58:03,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:58:03,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,875 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-07-23 05:58:03,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:58:03,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:58:03,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:58:03,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:58:03,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:58:03,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:58:03,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:58:03,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:58:03,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (1/1) ... [2022-07-23 05:58:03,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:58:03,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:58:03,957 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-23 05:58:03,963 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-23 05:58:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 05:58:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:58:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-07-23 05:58:03,994 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-07-23 05:58:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:58:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:58:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:58:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:58:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:58:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 05:58:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 05:58:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 05:58:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:58:03,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:58:04,130 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:58:04,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:58:04,959 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:58:04,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:58:04,967 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 05:58:04,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:58:04 BoogieIcfgContainer [2022-07-23 05:58:04,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:58:04,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:58:04,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:58:04,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:58:04,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:58:03" (1/3) ... [2022-07-23 05:58:04,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312e77b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:58:04, skipping insertion in model container [2022-07-23 05:58:04,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:03" (2/3) ... [2022-07-23 05:58:04,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312e77b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:58:04, skipping insertion in model container [2022-07-23 05:58:04,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:58:04" (3/3) ... [2022-07-23 05:58:04,975 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2022-07-23 05:58:04,984 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:58:04,985 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-07-23 05:58:05,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:58:05,026 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@4d785f55, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e93ed8e [2022-07-23 05:58:05,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-07-23 05:58:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 05:58:05,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:05,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 05:58:05,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-07-23 05:58:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:05,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331554850] [2022-07-23 05:58:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:05,058 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-23 05:58:05,064 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-23 05:58:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:05,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:58:05,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:05,231 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-23 05:58:05,277 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:58:05,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 05:58:05,302 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-23 05:58:05,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:05,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:05,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331554850] [2022-07-23 05:58:05,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331554850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:05,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:05,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:58:05,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471286520] [2022-07-23 05:58:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:05,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:58:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:58:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:58:05,334 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-23 05:58:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:05,825 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-07-23 05:58:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:58:05,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-23 05:58:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:05,838 INFO L225 Difference]: With dead ends: 208 [2022-07-23 05:58:05,840 INFO L226 Difference]: Without dead ends: 206 [2022-07-23 05:58:05,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 05:58:05,844 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:05,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:58:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-23 05:58:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-07-23 05:58:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-07-23 05:58:05,918 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-07-23 05:58:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:05,919 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-07-23 05:58:05,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-23 05:58:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-07-23 05:58:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 05:58:05,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:05,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 05:58:05,940 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-23 05:58:06,138 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-23 05:58:06,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-07-23 05:58:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:06,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521778806] [2022-07-23 05:58:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:06,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:06,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:06,147 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-23 05:58:06,185 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-23 05:58:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:06,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:58:06,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:06,244 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-23 05:58:06,255 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-23 05:58:06,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:06,310 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-23 05:58:06,320 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:06,322 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-23 05:58:06,343 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-23 05:58:06,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:06,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:06,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521778806] [2022-07-23 05:58:06,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521778806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:06,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:06,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:58:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580479624] [2022-07-23 05:58:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:06,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:58:06,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:06,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:58:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:58:06,348 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-23 05:58:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:06,925 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-07-23 05:58:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:58:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-23 05:58:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:06,928 INFO L225 Difference]: With dead ends: 196 [2022-07-23 05:58:06,929 INFO L226 Difference]: Without dead ends: 196 [2022-07-23 05:58:06,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 05:58:06,930 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:06,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 05:58:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-23 05:58:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-07-23 05:58:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-07-23 05:58:06,943 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-07-23 05:58:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:06,943 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-07-23 05:58:06,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-23 05:58:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-07-23 05:58:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 05:58:06,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:06,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 05:58:06,953 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-23 05:58:07,152 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-23 05:58:07,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-07-23 05:58:07,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:07,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754692906] [2022-07-23 05:58:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:07,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:07,156 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-23 05:58:07,157 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-23 05:58:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:07,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:58:07,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:07,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-23 05:58:07,220 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-23 05:58:07,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:07,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754692906] [2022-07-23 05:58:07,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754692906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:07,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:07,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062594477] [2022-07-23 05:58:07,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:07,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:07,223 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:07,489 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-07-23 05:58:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:07,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 05:58:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:07,493 INFO L225 Difference]: With dead ends: 208 [2022-07-23 05:58:07,493 INFO L226 Difference]: Without dead ends: 208 [2022-07-23 05:58:07,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:07,494 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:07,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:58:07,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-23 05:58:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-07-23 05:58:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-07-23 05:58:07,503 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-07-23 05:58:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:07,503 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-07-23 05:58:07,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-07-23 05:58:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 05:58:07,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:07,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 05:58:07,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 05:58:07,713 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-23 05:58:07,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-07-23 05:58:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:07,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049976615] [2022-07-23 05:58:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:07,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:07,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:07,716 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-23 05:58:07,743 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-23 05:58:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:07,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:58:07,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:07,796 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-23 05:58:07,809 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-23 05:58:07,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:07,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:07,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049976615] [2022-07-23 05:58:07,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049976615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:07,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:07,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:07,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435119694] [2022-07-23 05:58:07,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:07,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:07,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:07,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:07,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:07,812 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:08,128 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-07-23 05:58:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 05:58:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:08,130 INFO L225 Difference]: With dead ends: 181 [2022-07-23 05:58:08,130 INFO L226 Difference]: Without dead ends: 181 [2022-07-23 05:58:08,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:08,131 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:08,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:58:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-23 05:58:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-23 05:58:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-07-23 05:58:08,138 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-07-23 05:58:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:08,138 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-07-23 05:58:08,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-07-23 05:58:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:58:08,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:08,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:08,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 05:58:08,348 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-23 05:58:08,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-07-23 05:58:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230144722] [2022-07-23 05:58:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:08,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:08,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:08,351 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-23 05:58:08,352 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-23 05:58:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:08,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 05:58:08,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:08,432 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-23 05:58:08,457 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:08,458 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-23 05:58:08,499 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 14 treesize of output 16 [2022-07-23 05:58:08,504 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 14 treesize of output 16 [2022-07-23 05:58:08,530 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 15 treesize of output 7 [2022-07-23 05:58:08,534 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 15 treesize of output 7 [2022-07-23 05:58:08,547 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-23 05:58:08,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:08,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:08,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230144722] [2022-07-23 05:58:08,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230144722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:08,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:08,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:58:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420051952] [2022-07-23 05:58:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:08,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:58:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:58:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:58:08,550 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:08,960 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-07-23 05:58:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:58:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 05:58:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:08,962 INFO L225 Difference]: With dead ends: 183 [2022-07-23 05:58:08,962 INFO L226 Difference]: Without dead ends: 183 [2022-07-23 05:58:08,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:58:08,963 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:08,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 602 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:58:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-23 05:58:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-07-23 05:58:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-07-23 05:58:08,970 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-07-23 05:58:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:08,970 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-07-23 05:58:08,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-07-23 05:58:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:58:08,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:08,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:08,983 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-23 05:58:09,179 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-23 05:58:09,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-07-23 05:58:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680877915] [2022-07-23 05:58:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:09,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:09,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:09,182 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-23 05:58:09,182 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-23 05:58:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:09,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:58:09,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:09,276 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-23 05:58:09,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:09,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680877915] [2022-07-23 05:58:09,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680877915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:09,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:09,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:58:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032511883] [2022-07-23 05:58:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:09,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:58:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:58:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:58:09,279 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:09,310 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-07-23 05:58:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:58:09,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:58:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:09,312 INFO L225 Difference]: With dead ends: 258 [2022-07-23 05:58:09,312 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 05:58:09,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-23 05:58:09,313 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:09,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:58:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 05:58:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-07-23 05:58:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-07-23 05:58:09,321 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-07-23 05:58:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:09,321 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-07-23 05:58:09,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-07-23 05:58:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:58:09,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:09,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:09,339 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-23 05:58:09,531 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-23 05:58:09,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:09,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-07-23 05:58:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:09,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231750678] [2022-07-23 05:58:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:09,534 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-23 05:58:09,536 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-23 05:58:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:09,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 05:58:09,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:09,619 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:58:09,619 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-23 05:58:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:09,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:09,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:09,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231750678] [2022-07-23 05:58:09,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231750678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:09,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828450425] [2022-07-23 05:58:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:09,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:09,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:09,636 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:09,878 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-07-23 05:58:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:09,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 05:58:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:09,880 INFO L225 Difference]: With dead ends: 209 [2022-07-23 05:58:09,880 INFO L226 Difference]: Without dead ends: 209 [2022-07-23 05:58:09,880 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-23 05:58:09,881 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:09,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:58:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-23 05:58:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-07-23 05:58:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2022-07-23 05:58:09,886 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 13 [2022-07-23 05:58:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:09,886 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2022-07-23 05:58:09,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2022-07-23 05:58:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:58:09,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:09,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:09,899 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-23 05:58:10,088 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-23 05:58:10,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-07-23 05:58:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:10,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706004311] [2022-07-23 05:58:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:10,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:10,091 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-23 05:58:10,093 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-23 05:58:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:10,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:58:10,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:10,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:10,185 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 9 treesize of output 11 [2022-07-23 05:58:10,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:10,209 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-23 05:58:10,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:10,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:10,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706004311] [2022-07-23 05:58:10,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706004311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:10,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:10,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453673876] [2022-07-23 05:58:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:10,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:10,212 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:10,452 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-07-23 05:58:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 05:58:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:10,454 INFO L225 Difference]: With dead ends: 194 [2022-07-23 05:58:10,454 INFO L226 Difference]: Without dead ends: 194 [2022-07-23 05:58:10,454 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-23 05:58:10,455 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:10,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:58:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-23 05:58:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-07-23 05:58:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-07-23 05:58:10,460 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 13 [2022-07-23 05:58:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:10,460 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-07-23 05:58:10,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-07-23 05:58:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:58:10,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:10,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:10,472 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-23 05:58:10,670 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-23 05:58:10,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-07-23 05:58:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:10,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699523253] [2022-07-23 05:58:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:10,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:10,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:10,672 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-23 05:58:10,673 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-23 05:58:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:58:10,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:10,766 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 05:58:10,767 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-23 05:58:10,789 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-23 05:58:10,814 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 24 treesize of output 12 [2022-07-23 05:58:10,823 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-23 05:58:10,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:10,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:10,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699523253] [2022-07-23 05:58:10,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699523253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:10,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:10,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:58:10,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178941127] [2022-07-23 05:58:10,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:10,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:58:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:58:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:58:10,826 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:11,273 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-07-23 05:58:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:58:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:58:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:11,275 INFO L225 Difference]: With dead ends: 243 [2022-07-23 05:58:11,275 INFO L226 Difference]: Without dead ends: 243 [2022-07-23 05:58:11,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-23 05:58:11,276 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 25 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:11,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 387 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:58:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-23 05:58:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2022-07-23 05:58:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2022-07-23 05:58:11,281 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 17 [2022-07-23 05:58:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:11,282 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2022-07-23 05:58:11,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-07-23 05:58:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:58:11,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:11,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:11,296 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-23 05:58:11,493 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-23 05:58:11,493 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:11,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-07-23 05:58:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:11,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970838650] [2022-07-23 05:58:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:11,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:11,495 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-23 05:58:11,496 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-23 05:58:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:11,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 05:58:11,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:11,598 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:58:11,598 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:58:11,629 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-23 05:58:11,635 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-23 05:58:11,691 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-23 05:58:11,695 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-23 05:58:11,711 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-23 05:58:11,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:11,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:11,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970838650] [2022-07-23 05:58:11,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970838650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:11,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:11,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:58:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403142181] [2022-07-23 05:58:11,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:58:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:11,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:58:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:58:11,713 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:12,299 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-07-23 05:58:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:58:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:58:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:12,301 INFO L225 Difference]: With dead ends: 200 [2022-07-23 05:58:12,301 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 05:58:12,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:58:12,302 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:12,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 486 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 05:58:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 05:58:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-07-23 05:58:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-07-23 05:58:12,307 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2022-07-23 05:58:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:12,307 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-07-23 05:58:12,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-07-23 05:58:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:58:12,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:12,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:12,323 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-23 05:58:12,508 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-23 05:58:12,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-07-23 05:58:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171930551] [2022-07-23 05:58:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:12,511 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-23 05:58:12,512 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-23 05:58:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:12,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 05:58:12,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:12,652 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:58:12,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 05:58:12,674 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-23 05:58:12,758 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:12,759 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-23 05:58:12,804 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-23 05:58:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 05:58:12,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:12,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1))) is different from false [2022-07-23 05:58:12,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2022-07-23 05:58:12,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:12,950 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-23 05:58:12,952 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 40 treesize of output 28 [2022-07-23 05:58:12,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-07-23 05:58:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 05:58:13,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171930551] [2022-07-23 05:58:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171930551] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:13,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:13,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-07-23 05:58:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227415542] [2022-07-23 05:58:13,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:58:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:58:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-23 05:58:13,016 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:13,757 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-07-23 05:58:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:58:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 05:58:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:13,759 INFO L225 Difference]: With dead ends: 203 [2022-07-23 05:58:13,759 INFO L226 Difference]: Without dead ends: 203 [2022-07-23 05:58:13,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-07-23 05:58:13,760 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 25 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:13,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 797 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 333 Unchecked, 0.7s Time] [2022-07-23 05:58:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-23 05:58:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2022-07-23 05:58:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2022-07-23 05:58:13,764 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2022-07-23 05:58:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:13,765 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2022-07-23 05:58:13,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2022-07-23 05:58:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:58:13,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:13,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:13,778 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-23 05:58:13,967 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-23 05:58:13,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-07-23 05:58:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:13,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37661449] [2022-07-23 05:58:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:13,970 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-23 05:58:13,971 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-23 05:58:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:14,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 05:58:14,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:14,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:14,125 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 9 treesize of output 11 [2022-07-23 05:58:14,146 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-23 05:58:14,155 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-23 05:58:14,287 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:14,287 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-23 05:58:14,294 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-23 05:58:14,373 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-23 05:58:14,377 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-23 05:58:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:14,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:14,777 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-07-23 05:58:14,819 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_221) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:14,880 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-07-23 05:58:14,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:14,896 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-23 05:58:14,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:14,904 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-23 05:58:14,909 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 62 treesize of output 50 [2022-07-23 05:58:14,913 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 96 treesize of output 78 [2022-07-23 05:58:14,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 32 [2022-07-23 05:58:14,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 treesize of output 58 [2022-07-23 05:58:15,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:15,048 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-07-23 05:58:15,055 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 54 treesize of output 36 [2022-07-23 05:58:15,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2022-07-23 05:58:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 05:58:15,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:15,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37661449] [2022-07-23 05:58:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37661449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:15,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:15,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-23 05:58:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619059047] [2022-07-23 05:58:15,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:15,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 05:58:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:15,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 05:58:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-07-23 05:58:15,135 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:17,258 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-07-23 05:58:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:58:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 05:58:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:17,260 INFO L225 Difference]: With dead ends: 209 [2022-07-23 05:58:17,260 INFO L226 Difference]: Without dead ends: 209 [2022-07-23 05:58:17,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-07-23 05:58:17,262 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:17,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 887 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 464 Invalid, 0 Unknown, 237 Unchecked, 1.9s Time] [2022-07-23 05:58:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-23 05:58:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-07-23 05:58:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2022-07-23 05:58:17,267 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2022-07-23 05:58:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:17,268 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2022-07-23 05:58:17,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2022-07-23 05:58:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:58:17,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:17,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:17,277 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-23 05:58:17,471 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-23 05:58:17,472 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-07-23 05:58:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:17,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884363894] [2022-07-23 05:58:17,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:58:17,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:17,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:17,474 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-23 05:58:17,477 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-23 05:58:17,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:58:17,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:58:17,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 05:58:17,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:17,677 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:58:17,677 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:58:17,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:17,703 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-23 05:58:17,718 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-23 05:58:17,816 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:17,817 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-23 05:58:17,822 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-23 05:58:17,947 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:17,947 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-23 05:58:17,953 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-23 05:58:18,040 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-23 05:58:18,044 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-23 05:58:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:18,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:18,475 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-07-23 05:58:18,520 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:18,585 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_284) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-07-23 05:58:18,661 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse5) v_ArrVal_284) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2022-07-23 05:58:18,722 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) v_ArrVal_284)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_283))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_282) .cse5 v_ArrVal_284) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_285) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:18,791 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_283))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5))))))))) is different from false [2022-07-23 05:58:18,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:18,814 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-07-23 05:58:18,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:18,823 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-07-23 05:58:18,827 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 102 treesize of output 84 [2022-07-23 05:58:18,832 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 174 treesize of output 144 [2022-07-23 05:58:18,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 86 [2022-07-23 05:58:18,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 78 [2022-07-23 05:58:18,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 116 treesize of output 92 [2022-07-23 05:58:18,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:18,892 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-23 05:58:18,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:18,904 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-23 05:58:18,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:18,910 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 92 treesize of output 56 [2022-07-23 05:58:18,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:18,916 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 50 treesize of output 32 [2022-07-23 05:58:18,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 05:58:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-23 05:58:18,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884363894] [2022-07-23 05:58:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884363894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:18,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:18,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-07-23 05:58:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119863986] [2022-07-23 05:58:18,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:18,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 05:58:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 05:58:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-07-23 05:58:18,998 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:21,303 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2022-07-23 05:58:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:58:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 05:58:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:21,306 INFO L225 Difference]: With dead ends: 219 [2022-07-23 05:58:21,306 INFO L226 Difference]: Without dead ends: 219 [2022-07-23 05:58:21,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-07-23 05:58:21,307 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 20 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:21,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1216 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 578 Invalid, 0 Unknown, 522 Unchecked, 1.9s Time] [2022-07-23 05:58:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-23 05:58:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-07-23 05:58:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2022-07-23 05:58:21,311 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 27 [2022-07-23 05:58:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:21,312 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2022-07-23 05:58:21,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2022-07-23 05:58:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:58:21,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:21,312 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:21,324 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-23 05:58:21,513 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-23 05:58:21,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-07-23 05:58:21,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:21,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399067194] [2022-07-23 05:58:21,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:58:21,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:21,516 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-23 05:58:21,518 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-23 05:58:21,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:58:21,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:58:21,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:58:21,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:21,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:21,879 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 9 treesize of output 11 [2022-07-23 05:58:21,892 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-23 05:58:21,900 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-23 05:58:22,008 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:22,009 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-23 05:58:22,014 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-23 05:58:22,141 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:22,141 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-23 05:58:22,147 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-23 05:58:22,277 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:22,278 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-23 05:58:22,284 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-23 05:58:22,367 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-23 05:58:22,372 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-23 05:58:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:22,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:22,767 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_365) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-07-23 05:58:22,812 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:22,870 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-07-23 05:58:22,994 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363) c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363)) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:23,188 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:23,268 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:24,335 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_363))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse0 v_ArrVal_362) .cse1 v_ArrVal_364) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_365) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse7 v_ArrVal_362) (select (select (store .cse8 .cse7 v_ArrVal_363) c_create_data_~data~0.base) .cse9) v_ArrVal_364))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2022-07-23 05:58:26,438 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_360))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_363))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_361) .cse1 v_ArrVal_362) .cse2 v_ArrVal_364) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_365) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_360))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_361) .cse9 v_ArrVal_362) (select (select (store .cse10 .cse9 v_ArrVal_363) c_create_data_~data~0.base) .cse11) v_ArrVal_364)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2022-07-23 05:58:26,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_360))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) .cse2 v_ArrVal_362) (select (select (store .cse3 .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse4) v_ArrVal_364)))) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_360))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_363))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_361) .cse6 v_ArrVal_362) .cse7 v_ArrVal_364) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_365) c_create_data_~data~0.base) .cse8))))))))))) is different from false [2022-07-23 05:58:26,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:26,599 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2022-07-23 05:58:26,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:26,630 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2022-07-23 05:58:26,642 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 588 treesize of output 498 [2022-07-23 05:58:26,657 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 6342 treesize of output 5964 [2022-07-23 05:58:26,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5960 treesize of output 5544 [2022-07-23 05:58:26,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5544 treesize of output 5000 [2022-07-23 05:58:26,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5000 treesize of output 4128 [2022-07-23 05:58:26,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4128 treesize of output 3920 [2022-07-23 05:58:26,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3920 treesize of output 3712 [2022-07-23 05:58:30,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:30,383 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2022-07-23 05:58:30,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:30,406 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2022-07-23 05:58:30,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:30,419 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 460 treesize of output 310 [2022-07-23 05:58:30,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:30,439 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 368 treesize of output 314 [2022-07-23 05:58:30,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 310 treesize of output 286 [2022-07-23 05:58:30,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 286 treesize of output 226 [2022-07-23 05:58:30,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 226 treesize of output 210 [2022-07-23 05:58:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-07-23 05:58:30,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399067194] [2022-07-23 05:58:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399067194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:30,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:30,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2022-07-23 05:58:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698432167] [2022-07-23 05:58:30,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:30,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 05:58:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 05:58:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2022-07-23 05:58:30,677 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:36,491 INFO L93 Difference]: Finished difference Result 229 states and 249 transitions. [2022-07-23 05:58:36,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:58:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 05:58:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:36,494 INFO L225 Difference]: With dead ends: 229 [2022-07-23 05:58:36,494 INFO L226 Difference]: Without dead ends: 229 [2022-07-23 05:58:36,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=110, Invalid=337, Unknown=9, NotChecked=414, Total=870 [2022-07-23 05:58:36,495 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 26 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 838 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:36,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1625 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 792 Invalid, 0 Unknown, 838 Unchecked, 4.4s Time] [2022-07-23 05:58:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-23 05:58:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2022-07-23 05:58:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 222 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2022-07-23 05:58:36,502 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 32 [2022-07-23 05:58:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:36,502 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2022-07-23 05:58:36,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2022-07-23 05:58:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:58:36,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:36,503 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:36,515 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-23 05:58:36,711 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-23 05:58:36,711 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2022-07-23 05:58:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:36,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397093827] [2022-07-23 05:58:36,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:58:36,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:36,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:36,715 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-23 05:58:36,716 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-23 05:58:36,936 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:58:36,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:58:36,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:58:36,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:36,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:36,971 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 9 treesize of output 11 [2022-07-23 05:58:37,009 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-23 05:58:37,028 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-23 05:58:37,289 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:37,289 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-23 05:58:37,297 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-23 05:58:37,560 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:37,560 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-23 05:58:37,570 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-23 05:58:37,842 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:37,842 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-23 05:58:37,851 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-23 05:58:38,151 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:38,152 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-23 05:58:38,160 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-23 05:58:38,328 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-23 05:58:38,335 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-23 05:58:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:38,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:38,911 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_460) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_460) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_461) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-07-23 05:58:38,964 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_460) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_461) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_460) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) is different from false [2022-07-23 05:58:39,040 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_460) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_460) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_461) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:39,132 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) .cse0 v_ArrVal_460) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_461) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2022-07-23 05:58:39,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) v_ArrVal_460)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_458))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_459) .cse5 v_ArrVal_460) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_461) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:39,314 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) v_ArrVal_460)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_458))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_459) .cse5 v_ArrVal_460) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_461) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:40,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_458))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse0 v_ArrVal_459) .cse1 v_ArrVal_460) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_461) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse7 v_ArrVal_459) (select (select (store .cse8 .cse7 v_ArrVal_458) c_create_data_~data~0.base) .cse9) v_ArrVal_460))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2022-07-23 05:58:42,897 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_457))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_458))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_456) .cse1 v_ArrVal_459) .cse2 v_ArrVal_460) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_461) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_457))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_456) .cse9 v_ArrVal_459) (select (select (store .cse10 .cse9 v_ArrVal_458) c_create_data_~data~0.base) .cse11) v_ArrVal_460)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2022-07-23 05:58:43,066 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_457))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_456) .cse3 v_ArrVal_459) (select (select (store .cse4 .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_457))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_458))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_456) .cse7 v_ArrVal_459) .cse8 v_ArrVal_460) c_create_data_~data~0.base) .cse9) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_461) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2022-07-23 05:58:45,769 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_457))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse2 v_ArrVal_456) .cse3 v_ArrVal_459) (select (select (store .cse4 .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460))))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455)) (.cse10 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse7 (select (select .cse13 c_create_data_~data~0.base) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_457))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_458))) (let ((.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse7 v_ArrVal_456) .cse8 v_ArrVal_459) .cse9 v_ArrVal_460) c_create_data_~data~0.base) .cse10) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_461) c_create_data_~data~0.base) .cse10))))))))))) is different from false [2022-07-23 05:58:49,049 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_455))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_457))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_454) .cse3 v_ArrVal_456) .cse4 v_ArrVal_459) (select (select (store .cse5 .cse4 v_ArrVal_458) c_create_data_~data~0.base) .cse6) v_ArrVal_460)))))) c_create_data_~data~0.base) .cse6))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_455))) (let ((.cse9 (select (select .cse15 c_create_data_~data~0.base) .cse12))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_457))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_458))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_454) .cse9 v_ArrVal_456) .cse10 v_ArrVal_459) .cse11 v_ArrVal_460) c_create_data_~data~0.base) .cse12) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_461) c_create_data_~data~0.base) .cse12))))))))))))) is different from false [2022-07-23 05:58:50,160 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_455))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_457))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_458))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_454) .cse1 v_ArrVal_456) .cse2 v_ArrVal_459) .cse3 v_ArrVal_460) c_create_data_~data~0.base) .cse4) (_ bv20 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_461) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse13 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse9 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse13))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_455))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse13))) (let ((.cse12 (store .cse14 .cse10 v_ArrVal_457))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse13))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_454) .cse10 v_ArrVal_456) .cse11 v_ArrVal_459) (select (select (store .cse12 .cse11 v_ArrVal_458) c_create_data_~data~0.base) .cse13) v_ArrVal_460)))))) c_create_data_~data~0.base) .cse13)))) (bvule (bvadd (_ bv16 32) .cse8) (bvadd .cse8 (_ bv20 32)))))) is different from false [2022-07-23 05:58:50,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 354 [2022-07-23 05:58:50,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:50,573 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 204 [2022-07-23 05:58:50,682 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 177384 treesize of output 149466 [2022-07-23 05:58:53,064 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 4628326 treesize of output 4549600 [2022-07-23 05:59:02,678 WARN L233 SmtUtils]: Spent 9.61s on a formula simplification that was a NOOP. DAG size: 4913 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:12,119 WARN L233 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 4910 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:12,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4549596 treesize of output 4221532 [2022-07-23 05:59:21,711 WARN L233 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 4909 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:21,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4221532 treesize of output 3893468 [2022-07-23 05:59:31,384 WARN L233 SmtUtils]: Spent 9.48s on a formula simplification that was a NOOP. DAG size: 4908 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:31,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3893468 treesize of output 3810012 [2022-07-23 05:59:41,051 WARN L233 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 4907 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:41,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3810012 treesize of output 3434716 [2022-07-23 05:59:50,740 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification that was a NOOP. DAG size: 4906 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:50,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3434716 treesize of output 3280860 [2022-07-23 06:00:00,369 WARN L233 SmtUtils]: Spent 9.44s on a formula simplification that was a NOOP. DAG size: 4905 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:00,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3280860 treesize of output 3242588 [2022-07-23 06:00:10,126 WARN L233 SmtUtils]: Spent 9.56s on a formula simplification that was a NOOP. DAG size: 4904 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:10,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3242588 treesize of output 2987948 [2022-07-23 06:00:20,154 WARN L233 SmtUtils]: Spent 9.81s on a formula simplification that was a NOOP. DAG size: 4903 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:20,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2987948 treesize of output 2806124 [2022-07-23 06:00:30,100 WARN L233 SmtUtils]: Spent 9.72s on a formula simplification that was a NOOP. DAG size: 4899 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:01:03,784 WARN L233 SmtUtils]: Spent 33.56s on a formula simplification. DAG size of input: 4901 DAG size of output: 4901 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:02:07,101 WARN L233 SmtUtils]: Spent 53.90s on a formula simplification. DAG size of input: 4901 DAG size of output: 4901 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:02:25,770 WARN L233 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 2960 DAG size of output: 2960 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)