./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:13:27,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:13:27,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:13:27,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:13:27,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:13:27,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:13:27,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:13:27,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:13:27,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:13:27,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:13:27,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:13:27,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:13:27,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:13:27,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:13:27,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:13:27,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:13:27,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:13:27,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:13:27,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:13:27,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:13:27,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:13:27,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:13:27,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:13:27,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:13:27,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:13:27,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:13:27,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:13:27,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:13:27,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:13:27,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:13:27,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:13:27,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:13:27,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:13:27,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:13:27,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:13:27,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:13:27,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:13:27,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:13:27,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:13:27,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:13:27,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:13:27,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:13:27,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:13:27,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:13:27,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:13:27,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:13:27,314 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:13:27,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:13:27,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:13:27,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:13:27,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:13:27,316 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:13:27,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:13:27,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:13:27,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:13:27,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:13:27,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:13:27,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:13:27,317 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:13:27,318 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:13:27,318 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:13:27,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:13:27,318 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:13:27,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:13:27,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:13:27,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:13:27,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:13:27,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:13:27,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:13:27,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:13:27,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:13:27,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:13:27,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:13:27,320 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-07-21 17:13:27,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:13:27,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:13:27,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:13:27,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:13:27,591 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:13:27,592 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-2.i [2022-07-21 17:13:27,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe22f8bf/9ab8e097b09f40f48a158a562e8b6e0e/FLAG00673c51c [2022-07-21 17:13:28,063 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:13:28,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-07-21 17:13:28,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe22f8bf/9ab8e097b09f40f48a158a562e8b6e0e/FLAG00673c51c [2022-07-21 17:13:28,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe22f8bf/9ab8e097b09f40f48a158a562e8b6e0e [2022-07-21 17:13:28,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:13:28,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:13:28,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:13:28,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:13:28,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:13:28,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:28" (1/1) ... [2022-07-21 17:13:28,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5585e1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28, skipping insertion in model container [2022-07-21 17:13:28,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:28" (1/1) ... [2022-07-21 17:13:28,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:13:28,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:13:28,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:13:28,395 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-21 17:13:28,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e423d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:28, skipping insertion in model container [2022-07-21 17:13:28,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:13:28,396 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 17:13:28,398 INFO L158 Benchmark]: Toolchain (without parser) took 304.34ms. Allocated memory is still 60.8MB. Free memory was 40.3MB in the beginning and 42.2MB in the end (delta: -2.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 17:13:28,398 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:13:28,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.10ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 42.2MB in the end (delta: -2.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 17:13:28,400 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.10ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 42.2MB in the end (delta: -2.2MB). Peak memory consumption was 14.7MB. 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:13:29,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:13:29,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:13:29,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:13:29,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:13:29,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:13:29,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:13:29,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:13:29,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:13:29,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:13:29,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:13:29,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:13:29,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:13:29,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:13:29,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:13:29,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:13:29,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:13:29,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:13:29,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:13:29,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:13:29,819 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:13:29,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:13:29,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:13:29,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:13:29,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:13:29,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:13:29,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:13:29,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:13:29,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:13:29,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:13:29,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:13:29,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:13:29,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:13:29,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:13:29,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:13:29,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:13:29,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:13:29,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:13:29,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:13:29,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:13:29,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:13:29,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:13:29,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:13:29,868 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:13:29,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:13:29,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:13:29,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:13:29,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:13:29,869 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:13:29,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:13:29,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:13:29,870 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:13:29,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:13:29,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:13:29,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:13:29,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:13:29,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:13:29,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:13:29,872 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:13:29,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:13:29,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:13:29,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:13:29,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:13:29,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:13:29,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:13:29,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:13:29,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:13:29,874 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:13:29,874 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:13:29,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:13:29,874 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-07-21 17:13:30,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:13:30,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:13:30,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:13:30,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:13:30,140 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:13:30,141 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-2.i [2022-07-21 17:13:30,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea2d7dde/4f6c7341f0144031934cd29f4f2b76af/FLAG002667c42 [2022-07-21 17:13:30,611 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:13:30,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-07-21 17:13:30,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea2d7dde/4f6c7341f0144031934cd29f4f2b76af/FLAG002667c42 [2022-07-21 17:13:30,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea2d7dde/4f6c7341f0144031934cd29f4f2b76af [2022-07-21 17:13:30,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:13:30,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:13:30,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:13:30,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:13:30,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:13:30,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:30" (1/1) ... [2022-07-21 17:13:30,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fab99b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:30, skipping insertion in model container [2022-07-21 17:13:30,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:30" (1/1) ... [2022-07-21 17:13:30,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:13:30,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:13:30,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:13:30,936 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 17:13:30,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:13:30,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:13:30,964 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:13:30,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:13:31,010 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:13:31,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31 WrapperNode [2022-07-21 17:13:31,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:13:31,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:13:31,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:13:31,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:13:31,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,043 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-07-21 17:13:31,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:13:31,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:13:31,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:13:31,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:13:31,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:13:31,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:13:31,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:13:31,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:13:31,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (1/1) ... [2022-07-21 17:13:31,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:13:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:13:31,109 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-21 17:13:31,112 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-21 17:13:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:13:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:13:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-07-21 17:13:31,137 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:13:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:13:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:13:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:13:31,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:13:31,253 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:13:31,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:13:31,856 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:13:31,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:13:31,861 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 17:13:31,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:31 BoogieIcfgContainer [2022-07-21 17:13:31,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:13:31,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:13:31,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:13:31,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:13:31,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:13:30" (1/3) ... [2022-07-21 17:13:31,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4f7355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:13:31, skipping insertion in model container [2022-07-21 17:13:31,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:31" (2/3) ... [2022-07-21 17:13:31,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4f7355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:13:31, skipping insertion in model container [2022-07-21 17:13:31,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:31" (3/3) ... [2022-07-21 17:13:31,869 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2022-07-21 17:13:31,878 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:13:31,878 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-07-21 17:13:31,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:13:31,918 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@68971f97, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56acdab4 [2022-07-21 17:13:31,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-07-21 17:13:31,921 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-21 17:13:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-21 17:13:31,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:31,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-21 17:13:31,925 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-21 17:13:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-07-21 17:13:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:31,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529551336] [2022-07-21 17:13:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:31,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:31,940 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-21 17:13:31,963 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-21 17:13:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:32,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:13:32,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:32,108 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-21 17:13:32,139 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:13:32,140 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-21 17:13:32,152 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-21 17:13:32,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:32,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:32,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529551336] [2022-07-21 17:13:32,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529551336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:32,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:32,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:13:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754019056] [2022-07-21 17:13:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:32,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:13:32,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:13:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:13:32,176 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-21 17:13:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:32,548 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-07-21 17:13:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:13:32,549 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-21 17:13:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:32,556 INFO L225 Difference]: With dead ends: 208 [2022-07-21 17:13:32,556 INFO L226 Difference]: Without dead ends: 206 [2022-07-21 17:13:32,557 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-21 17:13:32,565 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:32,567 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.3s Time] [2022-07-21 17:13:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-21 17:13:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-07-21 17:13:32,603 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-21 17:13:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-07-21 17:13:32,615 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-07-21 17:13:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:32,615 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-07-21 17:13:32,615 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-21 17:13:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-07-21 17:13:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-21 17:13:32,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:32,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-21 17:13:32,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 17:13:32,822 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-21 17:13:32,822 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-21 17:13:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-07-21 17:13:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:32,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351180445] [2022-07-21 17:13:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:32,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:32,826 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-21 17:13:32,827 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-21 17:13:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:32,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:13:32,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:32,899 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-21 17:13:32,904 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-21 17:13:32,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:13:32,945 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-21 17:13:32,960 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:13:32,961 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-21 17:13:32,974 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-21 17:13:32,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:32,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351180445] [2022-07-21 17:13:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351180445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:32,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:32,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:13:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007378224] [2022-07-21 17:13:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:13:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:32,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:13:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:13:32,983 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-21 17:13:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:33,421 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-07-21 17:13:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:13:33,422 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-21 17:13:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:33,426 INFO L225 Difference]: With dead ends: 196 [2022-07-21 17:13:33,426 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 17:13:33,427 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-21 17:13:33,427 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:33,428 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.4s Time] [2022-07-21 17:13:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 17:13:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-07-21 17:13:33,436 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-21 17:13:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-07-21 17:13:33,437 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-07-21 17:13:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:33,437 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-07-21 17:13:33,438 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-21 17:13:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-07-21 17:13:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:13:33,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:33,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:13:33,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-21 17:13:33,644 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-21 17:13:33,645 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-21 17:13:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-07-21 17:13:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:33,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550627142] [2022-07-21 17:13:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:33,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:33,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:33,648 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-21 17:13:33,649 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-21 17:13:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:33,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:13:33,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:33,713 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-21 17:13:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:13:33,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:33,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550627142] [2022-07-21 17:13:33,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550627142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:33,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:33,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:13:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487269322] [2022-07-21 17:13:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:33,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:13:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:33,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:13:33,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:13:33,720 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-21 17:13:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:33,921 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-07-21 17:13:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:13:33,922 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-21 17:13:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:33,923 INFO L225 Difference]: With dead ends: 208 [2022-07-21 17:13:33,923 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:13:33,923 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-21 17:13:33,924 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:33,924 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.2s Time] [2022-07-21 17:13:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:13:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-07-21 17:13:33,930 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-21 17:13:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-07-21 17:13:33,931 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-07-21 17:13:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:33,931 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-07-21 17:13:33,932 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-21 17:13:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-07-21 17:13:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:13:33,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:33,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:13:33,941 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-21 17:13:34,132 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-21 17:13:34,133 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-21 17:13:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-07-21 17:13:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:34,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490650866] [2022-07-21 17:13:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:34,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:34,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:34,144 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-21 17:13:34,145 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-21 17:13:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:34,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:13:34,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:34,192 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-21 17:13:34,202 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-21 17:13:34,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:34,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:34,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490650866] [2022-07-21 17:13:34,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490650866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:34,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:34,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:13:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157071734] [2022-07-21 17:13:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:34,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:13:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:13:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:13:34,205 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-21 17:13:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:34,430 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-07-21 17:13:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:13:34,431 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-21 17:13:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:34,431 INFO L225 Difference]: With dead ends: 181 [2022-07-21 17:13:34,432 INFO L226 Difference]: Without dead ends: 181 [2022-07-21 17:13:34,432 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-21 17:13:34,433 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:34,433 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.2s Time] [2022-07-21 17:13:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-21 17:13:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-21 17:13:34,437 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-21 17:13:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-07-21 17:13:34,438 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-07-21 17:13:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:34,439 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-07-21 17:13:34,439 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-21 17:13:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-07-21 17:13:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:13:34,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:34,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:34,456 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-21 17:13:34,645 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-21 17:13:34,646 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-21 17:13:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:34,646 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-07-21 17:13:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:34,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440770178] [2022-07-21 17:13:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:34,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:34,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:34,648 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-21 17:13:34,649 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-21 17:13:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:34,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 17:13:34,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:34,727 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-21 17:13:34,749 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:13:34,750 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-21 17:13:34,781 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-21 17:13:34,786 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-21 17:13:34,811 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-21 17:13:34,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 15 treesize of output 7 [2022-07-21 17:13:34,826 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-21 17:13:34,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:34,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:34,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440770178] [2022-07-21 17:13:34,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440770178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:34,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:34,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:13:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689829588] [2022-07-21 17:13:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:13:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:13:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:13:34,829 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-21 17:13:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:35,144 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-07-21 17:13:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:13:35,145 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-21 17:13:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:35,145 INFO L225 Difference]: With dead ends: 183 [2022-07-21 17:13:35,145 INFO L226 Difference]: Without dead ends: 183 [2022-07-21 17:13:35,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:13:35,146 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:35,147 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.3s Time] [2022-07-21 17:13:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-21 17:13:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-07-21 17:13:35,151 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-21 17:13:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-07-21 17:13:35,152 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-07-21 17:13:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:35,152 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-07-21 17:13:35,153 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-21 17:13:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-07-21 17:13:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:13:35,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:35,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:35,173 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-21 17:13:35,360 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-21 17:13:35,362 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-21 17:13:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-07-21 17:13:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:35,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852253496] [2022-07-21 17:13:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:35,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:35,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:35,364 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-21 17:13:35,364 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-21 17:13:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:35,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:13:35,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:35,436 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-21 17:13:35,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:35,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852253496] [2022-07-21 17:13:35,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852253496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:35,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:35,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:13:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321370655] [2022-07-21 17:13:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:35,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:13:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:13:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:13:35,438 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-21 17:13:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:35,459 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-07-21 17:13:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:13:35,460 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-21 17:13:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:35,461 INFO L225 Difference]: With dead ends: 258 [2022-07-21 17:13:35,461 INFO L226 Difference]: Without dead ends: 258 [2022-07-21 17:13:35,461 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-21 17:13:35,462 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-21 17:13:35,462 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-21 17:13:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-21 17:13:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-07-21 17:13:35,467 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-21 17:13:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-07-21 17:13:35,468 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-07-21 17:13:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:35,468 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-07-21 17:13:35,468 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-21 17:13:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-07-21 17:13:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:13:35,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:35,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:35,477 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-21 17:13:35,677 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-21 17:13:35,678 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-21 17:13:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-07-21 17:13:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:35,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083255494] [2022-07-21 17:13:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:35,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:35,680 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-21 17:13:35,682 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-21 17:13:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:35,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:13:35,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:35,748 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:13:35,749 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-21 17:13:35,758 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-21 17:13:35,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:35,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:35,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083255494] [2022-07-21 17:13:35,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083255494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:35,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:35,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:13:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627133536] [2022-07-21 17:13:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:35,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:13:35,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:13:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:13:35,760 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-21 17:13:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:35,934 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2022-07-21 17:13:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:13:35,934 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-21 17:13:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:35,935 INFO L225 Difference]: With dead ends: 211 [2022-07-21 17:13:35,935 INFO L226 Difference]: Without dead ends: 211 [2022-07-21 17:13:35,935 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-21 17:13:35,936 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:35,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:13:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-21 17:13:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-07-21 17:13:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 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-21 17:13:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2022-07-21 17:13:35,941 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 13 [2022-07-21 17:13:35,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:35,941 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2022-07-21 17:13:35,941 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-21 17:13:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2022-07-21 17:13:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:13:35,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:35,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:35,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 17:13:36,148 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-21 17:13:36,149 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-21 17:13:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-07-21 17:13:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:36,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118555039] [2022-07-21 17:13:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:36,151 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-21 17:13:36,153 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-21 17:13:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:36,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:13:36,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:36,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:13:36,220 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-21 17:13:36,231 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-21 17:13:36,240 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-21 17:13:36,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:36,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118555039] [2022-07-21 17:13:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118555039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:36,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:36,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:13:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669416660] [2022-07-21 17:13:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:36,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:13:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:13:36,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:13:36,242 INFO L87 Difference]: Start difference. First operand 209 states and 247 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-21 17:13:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:36,446 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-07-21 17:13:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:13:36,446 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-21 17:13:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:36,447 INFO L225 Difference]: With dead ends: 198 [2022-07-21 17:13:36,447 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 17:13:36,447 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-21 17:13:36,447 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:36,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:13:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 17:13:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-07-21 17:13:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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-21 17:13:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2022-07-21 17:13:36,451 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 13 [2022-07-21 17:13:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:36,451 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2022-07-21 17:13:36,451 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-21 17:13:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2022-07-21 17:13:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:13:36,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:36,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:36,458 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-21 17:13:36,652 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-21 17:13:36,652 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-21 17:13:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-07-21 17:13:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609226828] [2022-07-21 17:13:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:36,654 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-21 17:13:36,655 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-21 17:13:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:36,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:13:36,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:36,730 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:13:36,731 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-21 17:13:36,746 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-21 17:13:36,764 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-21 17:13:36,771 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-21 17:13:36,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:36,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:36,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609226828] [2022-07-21 17:13:36,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609226828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:36,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:36,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:13:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620901324] [2022-07-21 17:13:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:36,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:13:36,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:36,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:13:36,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:13:36,773 INFO L87 Difference]: Start difference. First operand 196 states and 221 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-21 17:13:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:37,183 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2022-07-21 17:13:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:13:37,184 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-21 17:13:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:37,185 INFO L225 Difference]: With dead ends: 247 [2022-07-21 17:13:37,185 INFO L226 Difference]: Without dead ends: 247 [2022-07-21 17:13:37,185 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-21 17:13:37,185 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 25 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:37,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 397 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:13:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-21 17:13:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 202. [2022-07-21 17:13:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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-21 17:13:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions. [2022-07-21 17:13:37,190 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 17 [2022-07-21 17:13:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:37,190 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions. [2022-07-21 17:13:37,190 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-21 17:13:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions. [2022-07-21 17:13:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:13:37,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:37,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:13:37,199 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-21 17:13:37,399 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-21 17:13:37,400 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-21 17:13:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-07-21 17:13:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:37,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776063469] [2022-07-21 17:13:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:37,402 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-21 17:13:37,419 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-21 17:13:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:37,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:13:37,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:37,482 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:13:37,482 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-21 17:13:37,496 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-21 17:13:37,501 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-21 17:13:37,542 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-21 17:13:37,546 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-21 17:13:37,558 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-21 17:13:37,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:13:37,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776063469] [2022-07-21 17:13:37,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776063469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:13:37,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:13:37,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:13:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059596080] [2022-07-21 17:13:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:13:37,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:13:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:13:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:13:37,560 INFO L87 Difference]: Start difference. First operand 202 states and 231 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-21 17:13:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:37,971 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-07-21 17:13:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:13:37,976 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-21 17:13:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:37,977 INFO L225 Difference]: With dead ends: 204 [2022-07-21 17:13:37,977 INFO L226 Difference]: Without dead ends: 204 [2022-07-21 17:13:37,977 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-21 17:13:37,978 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:37,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:13:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-21 17:13:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-07-21 17:13:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 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-21 17:13:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2022-07-21 17:13:37,981 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17 [2022-07-21 17:13:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:37,981 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2022-07-21 17:13:37,982 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-21 17:13:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2022-07-21 17:13:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:13:37,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:37,982 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-21 17:13:37,989 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-21 17:13:38,182 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-21 17:13:38,183 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-21 17:13:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-07-21 17:13:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017541844] [2022-07-21 17:13:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:38,184 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-21 17:13:38,185 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-21 17:13:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:38,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:13:38,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:38,296 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:13:38,296 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-21 17:13:38,319 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-21 17:13:38,381 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:38,381 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-21 17:13:38,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-21 17:13:38,433 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-21 17:13:38,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:38,465 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-21 17:13:38,487 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-21 17:13:38,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:38,504 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-21 17:13:38,506 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-21 17:13:38,509 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-21 17:13:38,539 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-21 17:13:38,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:38,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017541844] [2022-07-21 17:13:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017541844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:13:38,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:13:38,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-07-21 17:13:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878792625] [2022-07-21 17:13:38,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:13:38,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:13:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:38,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:13:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-21 17:13:38,540 INFO L87 Difference]: Start difference. First operand 202 states and 227 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-21 17:13:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:39,121 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-07-21 17:13:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:13:39,121 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-21 17:13:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:39,122 INFO L225 Difference]: With dead ends: 207 [2022-07-21 17:13:39,122 INFO L226 Difference]: Without dead ends: 207 [2022-07-21 17:13:39,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-07-21 17:13:39,123 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:39,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 736 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 266 Unchecked, 0.5s Time] [2022-07-21 17:13:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-21 17:13:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-07-21 17:13:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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-21 17:13:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2022-07-21 17:13:39,126 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22 [2022-07-21 17:13:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:39,126 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2022-07-21 17:13:39,126 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-21 17:13:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2022-07-21 17:13:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:13:39,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:39,127 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-21 17:13:39,138 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-21 17:13:39,331 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-21 17:13:39,332 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-21 17:13:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-07-21 17:13:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506921581] [2022-07-21 17:13:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:13:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:39,334 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-21 17:13:39,335 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-21 17:13:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:13:39,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:13:39,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:39,452 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-21 17:13:39,457 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-21 17:13:39,475 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-21 17:13:39,482 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-21 17:13:39,570 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:39,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, 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-21 17:13:39,575 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-21 17:13:39,631 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-21 17:13:39,635 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-21 17:13:39,653 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-21 17:13:39,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:39,971 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-21 17:13:40,008 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-21 17:13:40,056 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-21 17:13:40,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:40,067 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-21 17:13:40,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:40,073 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-21 17:13:40,076 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-21 17:13:40,083 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-21 17:13:40,088 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-21 17:13:40,090 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-21 17:13:40,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:40,168 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-21 17:13:40,170 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-21 17:13:40,175 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-21 17:13:40,271 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-21 17:13:40,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:40,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506921581] [2022-07-21 17:13:40,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506921581] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:13:40,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:13:40,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-21 17:13:40,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78696057] [2022-07-21 17:13:40,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:13:40,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 17:13:40,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:40,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 17:13:40,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-07-21 17:13:40,274 INFO L87 Difference]: Start difference. First operand 201 states and 225 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-21 17:13:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:42,076 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-07-21 17:13:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:13:42,077 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-21 17:13:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:42,077 INFO L225 Difference]: With dead ends: 213 [2022-07-21 17:13:42,077 INFO L226 Difference]: Without dead ends: 213 [2022-07-21 17:13:42,078 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-21 17:13:42,078 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 17 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:42,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 911 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 402 Invalid, 0 Unknown, 333 Unchecked, 1.6s Time] [2022-07-21 17:13:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-21 17:13:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-07-21 17:13:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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-21 17:13:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2022-07-21 17:13:42,082 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22 [2022-07-21 17:13:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:42,082 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2022-07-21 17:13:42,082 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-21 17:13:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2022-07-21 17:13:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:13:42,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:42,083 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-21 17:13:42,092 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-21 17:13:42,290 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-21 17:13:42,290 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-21 17:13:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-07-21 17:13:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:42,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569406342] [2022-07-21 17:13:42,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:13:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:42,293 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-21 17:13:42,293 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-21 17:13:42,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:13:42,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:13:42,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 17:13:42,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:42,456 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:13:42,456 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-21 17:13:42,463 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-21 17:13:42,476 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-21 17:13:42,485 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-21 17:13:42,581 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:42,581 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-21 17:13:42,589 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-21 17:13:42,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:42,677 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-21 17:13:42,681 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-21 17:13:42,737 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-21 17:13:42,741 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-21 17:13:42,759 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-21 17:13:42,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:43,062 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-21 17:13:43,093 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-21 17:13:43,150 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-21 17:13:43,209 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-21 17:13:43,245 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-21 17:13:43,289 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-21 17:13:43,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:43,302 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-21 17:13:43,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:43,308 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-21 17:13:43,312 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-21 17:13:43,314 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-21 17:13:43,323 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-21 17:13:43,330 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-21 17:13:43,332 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-21 17:13:43,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:43,355 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-21 17:13:43,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:43,363 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-21 17:13:43,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:43,369 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-21 17:13:43,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:43,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, 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-21 17:13:43,377 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-21 17:13:43,435 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-21 17:13:43,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569406342] [2022-07-21 17:13:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569406342] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:13:43,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:13:43,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-07-21 17:13:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769719932] [2022-07-21 17:13:43,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:13:43,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:13:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:43,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:13:43,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-07-21 17:13:43,437 INFO L87 Difference]: Start difference. First operand 211 states and 235 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-21 17:13:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:45,644 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-07-21 17:13:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:13:45,645 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-21 17:13:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:45,646 INFO L225 Difference]: With dead ends: 223 [2022-07-21 17:13:45,646 INFO L226 Difference]: Without dead ends: 223 [2022-07-21 17:13:45,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-07-21 17:13:45,646 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 17 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:45,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1329 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 672 Invalid, 0 Unknown, 534 Unchecked, 1.8s Time] [2022-07-21 17:13:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-21 17:13:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2022-07-21 17:13:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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-21 17:13:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2022-07-21 17:13:45,650 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27 [2022-07-21 17:13:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:45,650 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2022-07-21 17:13:45,650 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-21 17:13:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2022-07-21 17:13:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:13:45,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:45,651 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-21 17:13:45,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-21 17:13:45,859 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-21 17:13:45,859 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-21 17:13:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-07-21 17:13:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:45,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649524541] [2022-07-21 17:13:45,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:13:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:45,862 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-21 17:13:45,863 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-21 17:13:46,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 17:13:46,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:13:46,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 17:13:46,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:46,144 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-21 17:13:46,147 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-21 17:13:46,168 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-21 17:13:46,174 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-21 17:13:46,264 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:46,265 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-21 17:13:46,269 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-21 17:13:46,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:46,361 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-21 17:13:46,366 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-21 17:13:46,460 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:46,461 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-21 17:13:46,464 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-21 17:13:46,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 31 treesize of output 13 [2022-07-21 17:13:46,533 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-21 17:13:46,551 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-21 17:13:46,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:46,853 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-21 17:13:46,885 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-21 17:13:46,930 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-21 17:13:47,039 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-21 17:13:47,127 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-21 17:13:47,190 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-21 17:13:47,753 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-21 17:13:48,297 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-21 17:13:48,398 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-21 17:13:48,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:48,429 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-21 17:13:48,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:48,444 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-21 17:13:48,453 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-21 17:13:48,463 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-21 17:13:48,511 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-21 17:13:48,533 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-21 17:13:48,560 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-21 17:13:48,581 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-21 17:13:48,608 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-21 17:13:49,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:49,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, 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-21 17:13:49,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:13:49,644 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-21 17:13:49,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:49,654 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-21 17:13:49,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:13:49,664 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-21 17:13:49,672 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-21 17:13:49,680 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-21 17:13:49,688 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-21 17:13:49,862 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-21 17:13:49,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:13:49,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649524541] [2022-07-21 17:13:49,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649524541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:13:49,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:13:49,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2022-07-21 17:13:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342398366] [2022-07-21 17:13:49,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:13:49,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 17:13:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:13:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 17:13:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2022-07-21 17:13:49,864 INFO L87 Difference]: Start difference. First operand 221 states and 245 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-21 17:13:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:13:54,587 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions. [2022-07-21 17:13:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:13:54,588 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-21 17:13:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:13:54,589 INFO L225 Difference]: With dead ends: 233 [2022-07-21 17:13:54,589 INFO L226 Difference]: Without dead ends: 233 [2022-07-21 17:13:54,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=110, Invalid=337, Unknown=9, NotChecked=414, Total=870 [2022-07-21 17:13:54,590 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 26 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:13:54,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1660 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 799 Invalid, 0 Unknown, 856 Unchecked, 3.7s Time] [2022-07-21 17:13:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-21 17:13:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-07-21 17:13:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 226 states have internal predecessors, (251), 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-21 17:13:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions. [2022-07-21 17:13:54,594 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 32 [2022-07-21 17:13:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:13:54,595 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions. [2022-07-21 17:13:54,596 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-21 17:13:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions. [2022-07-21 17:13:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:13:54,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:13:54,599 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-21 17:13:54,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-21 17:13:54,803 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-21 17:13:54,804 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-21 17:13:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:13:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2022-07-21 17:13:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:13:54,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587312670] [2022-07-21 17:13:54,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 17:13:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:13:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:13:54,806 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-21 17:13:54,807 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-21 17:13:54,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 17:13:54,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:13:55,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:13:55,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:13:55,018 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-21 17:13:55,029 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-21 17:13:55,062 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-21 17:13:55,079 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-21 17:13:55,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:55,282 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-21 17:13:55,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, 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-21 17:13:55,497 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:55,497 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-21 17:13:55,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 22 treesize of output 24 [2022-07-21 17:13:55,736 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:55,737 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-21 17:13:55,744 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-21 17:13:55,994 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:13:55,994 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-21 17:13:56,002 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-21 17:13:56,140 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-21 17:13:56,146 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-21 17:13:56,196 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-21 17:13:56,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:13:56,661 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-21 17:13:56,705 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-21 17:13:56,782 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-21 17:13:56,853 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-21 17:13:56,908 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-21 17:13:56,986 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-21 17:13:58,732 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-21 17:14:00,823 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-21 17:14:00,975 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-21 17:14:03,733 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-21 17:14:07,021 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-21 17:14:07,906 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-21 17:14:08,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:14:08,106 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-21 17:14:08,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:14:08,252 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-21 17:14:08,337 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-21 17:14:10,499 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-21 17:14:19,315 WARN L233 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 4913 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:14:27,993 WARN L233 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 4910 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:14:28,176 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-21 17:14:36,817 WARN L233 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 4909 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:14:37,006 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-21 17:14:45,821 WARN L233 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 4908 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:14:46,000 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-21 17:14:54,616 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 4907 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:14:54,794 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-21 17:15:03,381 WARN L233 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 4906 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:15:03,564 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-21 17:15:12,215 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 4905 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:15:12,393 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-21 17:15:20,974 WARN L233 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 4904 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:15:21,150 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-21 17:15:29,714 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 4903 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:15:29,893 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-21 17:15:38,469 WARN L233 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 4899 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:16:08,560 WARN L233 SmtUtils]: Spent 29.83s on a formula simplification. DAG size of input: 4901 DAG size of output: 4901 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:17:17,319 WARN L233 SmtUtils]: Spent 47.57s on a formula simplification. DAG size of input: 4901 DAG size of output: 4901 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 17:17:50,006 WARN L233 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 2960 DAG size of output: 2960 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)