./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.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 f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 13:01:31,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:01:31,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:01:32,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:01:32,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:01:32,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:01:32,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:01:32,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:01:32,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:01:32,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:01:32,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:01:32,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:01:32,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:01:32,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:01:32,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:01:32,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:01:32,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:01:32,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:01:32,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:01:32,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:01:32,045 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:01:32,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:01:32,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:01:32,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:01:32,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:01:32,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:01:32,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:01:32,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:01:32,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:01:32,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:01:32,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:01:32,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:01:32,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:01:32,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:01:32,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:01:32,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:01:32,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:01:32,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:01:32,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:01:32,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:01:32,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:01:32,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:01:32,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 13:01:32,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:01:32,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:01:32,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:01:32,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:01:32,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:01:32,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:01:32,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:01:32,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:01:32,084 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:01:32,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:01:32,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 13:01:32,086 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 13:01:32,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:01:32,088 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 13:01:32,088 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:01:32,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:01:32,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:01:32,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:01:32,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:01:32,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:01:32,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:01:32,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:01:32,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 13:01:32,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 13:01:32,090 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 -> f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee [2022-07-23 13:01:32,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:01:32,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:01:32,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:01:32,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:01:32,290 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:01:32,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2022-07-23 13:01:32,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d9dd539/f391bb6e777943f09236164893dfb655/FLAG71af519cd [2022-07-23 13:01:32,801 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:01:32,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2022-07-23 13:01:32,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d9dd539/f391bb6e777943f09236164893dfb655/FLAG71af519cd [2022-07-23 13:01:33,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d9dd539/f391bb6e777943f09236164893dfb655 [2022-07-23 13:01:33,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:01:33,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:01:33,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:01:33,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:01:33,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:01:33,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:01:33" (1/1) ... [2022-07-23 13:01:33,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a37667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:33, skipping insertion in model container [2022-07-23 13:01:33,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:01:33" (1/1) ... [2022-07-23 13:01:33,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:01:33,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:01:33,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i[33021,33034] [2022-07-23 13:01:33,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:01:33,618 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-23 13:01:33,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f9696ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:33, skipping insertion in model container [2022-07-23 13:01:33,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:01:33,619 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 13:01:33,621 INFO L158 Benchmark]: Toolchain (without parser) took 486.46ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 64.5MB in the end (delta: -2.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-07-23 13:01:33,621 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:01:33,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.59ms. Allocated memory is still 102.8MB. Free memory was 61.5MB in the beginning and 64.5MB in the end (delta: -2.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-07-23 13:01:33,624 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.14ms. Allocated memory is still 102.8MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.59ms. Allocated memory is still 102.8MB. Free memory was 61.5MB in the beginning and 64.5MB in the end (delta: -2.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.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 f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 13:01:35,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:01:35,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:01:35,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:01:35,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:01:35,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:01:35,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:01:35,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:01:35,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:01:35,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:01:35,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:01:35,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:01:35,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:01:35,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:01:35,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:01:35,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:01:35,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:01:35,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:01:35,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:01:35,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:01:35,293 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:01:35,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:01:35,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:01:35,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:01:35,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:01:35,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:01:35,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:01:35,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:01:35,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:01:35,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:01:35,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:01:35,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:01:35,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:01:35,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:01:35,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:01:35,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:01:35,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:01:35,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:01:35,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:01:35,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:01:35,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:01:35,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:01:35,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 13:01:35,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:01:35,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:01:35,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:01:35,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:01:35,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:01:35,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:01:35,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:01:35,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:01:35,383 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:01:35,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:01:35,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:01:35,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:01:35,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:01:35,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:01:35,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:01:35,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:01:35,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:01:35,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:01:35,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 13:01:35,399 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 13:01:35,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 13:01:35,400 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 -> f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee [2022-07-23 13:01:35,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:01:35,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:01:35,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:01:35,704 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:01:35,708 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:01:35,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2022-07-23 13:01:35,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b519f2f18/ef10f5ff080f4da0a93b8f391f9f4cb6/FLAGb3c21670a [2022-07-23 13:01:36,200 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:01:36,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2022-07-23 13:01:36,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b519f2f18/ef10f5ff080f4da0a93b8f391f9f4cb6/FLAGb3c21670a [2022-07-23 13:01:36,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b519f2f18/ef10f5ff080f4da0a93b8f391f9f4cb6 [2022-07-23 13:01:36,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:01:36,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:01:36,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:01:36,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:01:36,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:01:36,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:01:36" (1/1) ... [2022-07-23 13:01:36,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229765fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:36, skipping insertion in model container [2022-07-23 13:01:36,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:01:36" (1/1) ... [2022-07-23 13:01:36,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:01:36,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:01:36,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i[33021,33034] [2022-07-23 13:01:36,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:01:37,004 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 13:01:37,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:01:37,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i[33021,33034] [2022-07-23 13:01:37,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:01:37,109 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 13:01:37,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i[33021,33034] [2022-07-23 13:01:37,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:01:37,226 INFO L208 MainTranslator]: Completed translation [2022-07-23 13:01:37,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37 WrapperNode [2022-07-23 13:01:37,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:01:37,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 13:01:37,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 13:01:37,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 13:01:37,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,338 INFO L137 Inliner]: procedures = 180, calls = 448, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1473 [2022-07-23 13:01:37,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 13:01:37,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 13:01:37,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 13:01:37,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 13:01:37,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 13:01:37,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 13:01:37,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 13:01:37,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 13:01:37,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (1/1) ... [2022-07-23 13:01:37,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:01:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:01:37,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 13:01:37,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 13:01:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 13:01:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 13:01:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 13:01:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 13:01:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 13:01:37,598 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 13:01:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 13:01:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 13:01:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 13:01:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 13:01:37,855 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 13:01:37,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 13:01:37,859 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 13:01:41,886 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 13:01:41,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 13:01:41,905 INFO L299 CfgBuilder]: Removed 77 assume(true) statements. [2022-07-23 13:01:41,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:01:41 BoogieIcfgContainer [2022-07-23 13:01:41,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 13:01:41,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 13:01:41,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 13:01:41,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 13:01:41,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:01:36" (1/3) ... [2022-07-23 13:01:41,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196d244f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:01:41, skipping insertion in model container [2022-07-23 13:01:41,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:01:37" (2/3) ... [2022-07-23 13:01:41,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196d244f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:01:41, skipping insertion in model container [2022-07-23 13:01:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:01:41" (3/3) ... [2022-07-23 13:01:41,915 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-3.i [2022-07-23 13:01:41,928 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 13:01:41,928 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2022-07-23 13:01:41,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 13:01:41,995 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@619925b3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56a9c3b3 [2022-07-23 13:01:41,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2022-07-23 13:01:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 13:01:42,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:42,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 13:01:42,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-23 13:01:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005848902] [2022-07-23 13:01:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:42,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:42,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:42,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 13:01:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:42,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-23 13:01:42,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:42,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:42,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:42,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005848902] [2022-07-23 13:01:42,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005848902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:42,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:42,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:01:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662601378] [2022-07-23 13:01:42,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:42,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 13:01:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:42,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 13:01:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:01:42,263 INFO L87 Difference]: Start difference. First operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:42,308 INFO L93 Difference]: Finished difference Result 1633 states and 1726 transitions. [2022-07-23 13:01:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 13:01:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 13:01:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:42,326 INFO L225 Difference]: With dead ends: 1633 [2022-07-23 13:01:42,327 INFO L226 Difference]: Without dead ends: 1631 [2022-07-23 13:01:42,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:01:42,330 INFO L413 NwaCegarLoop]: 1726 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:42,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:01:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-07-23 13:01:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-07-23 13:01:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 778 states have (on average 2.1748071979434447) internal successors, (1692), 1622 states have internal predecessors, (1692), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1724 transitions. [2022-07-23 13:01:42,409 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1724 transitions. Word has length 5 [2022-07-23 13:01:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:42,410 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 1724 transitions. [2022-07-23 13:01:42,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1724 transitions. [2022-07-23 13:01:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 13:01:42,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:42,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 13:01:42,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:42,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:42,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:42,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-23 13:01:42,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:42,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390450828] [2022-07-23 13:01:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:42,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:42,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:42,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 13:01:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:42,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:01:42,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:42,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:01:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:42,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:42,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390450828] [2022-07-23 13:01:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390450828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:42,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:42,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:01:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238579417] [2022-07-23 13:01:42,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:42,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:01:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:01:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:42,904 INFO L87 Difference]: Start difference. First operand 1631 states and 1724 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:44,746 INFO L93 Difference]: Finished difference Result 1668 states and 1774 transitions. [2022-07-23 13:01:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:01:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 13:01:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:44,751 INFO L225 Difference]: With dead ends: 1668 [2022-07-23 13:01:44,751 INFO L226 Difference]: Without dead ends: 1668 [2022-07-23 13:01:44,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:44,752 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 1159 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:44,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1291 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-23 13:01:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2022-07-23 13:01:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1614. [2022-07-23 13:01:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 854 states have (on average 2.030444964871194) internal successors, (1734), 1605 states have internal predecessors, (1734), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1766 transitions. [2022-07-23 13:01:44,777 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1766 transitions. Word has length 5 [2022-07-23 13:01:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:44,777 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1766 transitions. [2022-07-23 13:01:44,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1766 transitions. [2022-07-23 13:01:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 13:01:44,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:44,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 13:01:44,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:44,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:44,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:44,985 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-23 13:01:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:44,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553336866] [2022-07-23 13:01:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:44,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:44,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 13:01:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:45,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:01:45,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:45,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:01:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:45,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:45,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:45,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553336866] [2022-07-23 13:01:45,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553336866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:45,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:45,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:01:45,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701766927] [2022-07-23 13:01:45,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:45,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:01:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:45,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:01:45,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:45,112 INFO L87 Difference]: Start difference. First operand 1614 states and 1766 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:47,577 INFO L93 Difference]: Finished difference Result 1917 states and 2089 transitions. [2022-07-23 13:01:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:01:47,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 13:01:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:47,583 INFO L225 Difference]: With dead ends: 1917 [2022-07-23 13:01:47,583 INFO L226 Difference]: Without dead ends: 1917 [2022-07-23 13:01:47,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:47,596 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 504 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:47,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2076 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 13:01:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-07-23 13:01:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1770. [2022-07-23 13:01:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1020 states have (on average 2.0) internal successors, (2040), 1761 states have internal predecessors, (2040), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2072 transitions. [2022-07-23 13:01:47,640 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2072 transitions. Word has length 5 [2022-07-23 13:01:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:47,640 INFO L495 AbstractCegarLoop]: Abstraction has 1770 states and 2072 transitions. [2022-07-23 13:01:47,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2072 transitions. [2022-07-23 13:01:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 13:01:47,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:47,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 13:01:47,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-23 13:01:47,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:47,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-23 13:01:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:47,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788150536] [2022-07-23 13:01:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:47,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:47,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 13:01:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:47,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 13:01:47,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:47,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:47,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:47,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788150536] [2022-07-23 13:01:47,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788150536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:47,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:47,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:01:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723770457] [2022-07-23 13:01:47,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:47,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:01:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:47,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:01:47,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:47,974 INFO L87 Difference]: Start difference. First operand 1770 states and 2072 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:48,062 INFO L93 Difference]: Finished difference Result 3114 states and 3679 transitions. [2022-07-23 13:01:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:01:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 13:01:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:48,077 INFO L225 Difference]: With dead ends: 3114 [2022-07-23 13:01:48,078 INFO L226 Difference]: Without dead ends: 3114 [2022-07-23 13:01:48,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:48,080 INFO L413 NwaCegarLoop]: 1900 mSDtfsCounter, 1143 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:48,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3516 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:01:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-23 13:01:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1771. [2022-07-23 13:01:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1021 states have (on average 1.999020568070519) internal successors, (2041), 1762 states have internal predecessors, (2041), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2073 transitions. [2022-07-23 13:01:48,120 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2073 transitions. Word has length 6 [2022-07-23 13:01:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:48,123 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2073 transitions. [2022-07-23 13:01:48,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2073 transitions. [2022-07-23 13:01:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 13:01:48,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:48,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:48,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:48,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:48,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-23 13:01:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842813668] [2022-07-23 13:01:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:48,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:48,334 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:48,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 13:01:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:48,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 13:01:48,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:48,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:48,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:48,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842813668] [2022-07-23 13:01:48,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842813668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:48,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:48,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:01:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524004071] [2022-07-23 13:01:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:48,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:01:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:48,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:01:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:48,489 INFO L87 Difference]: Start difference. First operand 1771 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:48,523 INFO L93 Difference]: Finished difference Result 1735 states and 2036 transitions. [2022-07-23 13:01:48,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:01:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 13:01:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:48,529 INFO L225 Difference]: With dead ends: 1735 [2022-07-23 13:01:48,529 INFO L226 Difference]: Without dead ends: 1735 [2022-07-23 13:01:48,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:48,530 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 1533 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:48,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1606 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:01:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-23 13:01:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1729. [2022-07-23 13:01:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1003 states have (on average 1.992023928215354) internal successors, (1998), 1720 states have internal predecessors, (1998), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2030 transitions. [2022-07-23 13:01:48,559 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2030 transitions. Word has length 11 [2022-07-23 13:01:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:48,559 INFO L495 AbstractCegarLoop]: Abstraction has 1729 states and 2030 transitions. [2022-07-23 13:01:48,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2030 transitions. [2022-07-23 13:01:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 13:01:48,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:48,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:48,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:48,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:48,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-23 13:01:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:48,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076271501] [2022-07-23 13:01:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:48,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:48,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:48,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 13:01:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:48,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:01:48,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:48,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:48,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076271501] [2022-07-23 13:01:48,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076271501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:48,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:48,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:01:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498313930] [2022-07-23 13:01:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:48,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:01:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:01:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:01:48,940 INFO L87 Difference]: Start difference. First operand 1729 states and 2030 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:48,999 INFO L93 Difference]: Finished difference Result 1714 states and 2008 transitions. [2022-07-23 13:01:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:01:48,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 13:01:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:49,004 INFO L225 Difference]: With dead ends: 1714 [2022-07-23 13:01:49,004 INFO L226 Difference]: Without dead ends: 1714 [2022-07-23 13:01:49,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:01:49,005 INFO L413 NwaCegarLoop]: 1528 mSDtfsCounter, 1504 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:49,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3082 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:01:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-07-23 13:01:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1707. [2022-07-23 13:01:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 995 states have (on average 1.9788944723618092) internal successors, (1969), 1698 states have internal predecessors, (1969), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2001 transitions. [2022-07-23 13:01:49,029 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2001 transitions. Word has length 13 [2022-07-23 13:01:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:49,029 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2001 transitions. [2022-07-23 13:01:49,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2001 transitions. [2022-07-23 13:01:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 13:01:49,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:49,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:49,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:49,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:49,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-23 13:01:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:49,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602521574] [2022-07-23 13:01:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:49,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:49,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:49,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:49,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 13:01:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:49,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:01:49,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:49,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:01:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:49,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:49,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602521574] [2022-07-23 13:01:49,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602521574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:49,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:49,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:01:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124251704] [2022-07-23 13:01:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:49,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:01:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:01:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:01:49,444 INFO L87 Difference]: Start difference. First operand 1707 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:52,336 INFO L93 Difference]: Finished difference Result 2520 states and 2820 transitions. [2022-07-23 13:01:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:01:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 13:01:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:52,343 INFO L225 Difference]: With dead ends: 2520 [2022-07-23 13:01:52,343 INFO L226 Difference]: Without dead ends: 2520 [2022-07-23 13:01:52,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:01:52,344 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 2761 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:52,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 1876 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 13:01:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-07-23 13:01:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1703. [2022-07-23 13:01:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 995 states have (on average 1.9748743718592965) internal successors, (1965), 1694 states have internal predecessors, (1965), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1997 transitions. [2022-07-23 13:01:52,374 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1997 transitions. Word has length 27 [2022-07-23 13:01:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:52,375 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 1997 transitions. [2022-07-23 13:01:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1997 transitions. [2022-07-23 13:01:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 13:01:52,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:52,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:52,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-23 13:01:52,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:52,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-23 13:01:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:52,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514554604] [2022-07-23 13:01:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:52,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:52,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:52,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 13:01:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:52,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 13:01:52,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:52,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:01:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:52,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:52,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:52,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514554604] [2022-07-23 13:01:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514554604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:52,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:01:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158242205] [2022-07-23 13:01:52,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:52,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:01:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:01:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:01:52,891 INFO L87 Difference]: Start difference. First operand 1703 states and 1997 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:56,593 INFO L93 Difference]: Finished difference Result 2264 states and 2467 transitions. [2022-07-23 13:01:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:01:56,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 13:01:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:56,600 INFO L225 Difference]: With dead ends: 2264 [2022-07-23 13:01:56,600 INFO L226 Difference]: Without dead ends: 2264 [2022-07-23 13:01:56,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:01:56,601 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1247 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:56,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2536 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-23 13:01:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-07-23 13:01:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1699. [2022-07-23 13:01:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 995 states have (on average 1.9708542713567838) internal successors, (1961), 1690 states have internal predecessors, (1961), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1993 transitions. [2022-07-23 13:01:56,638 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1993 transitions. Word has length 27 [2022-07-23 13:01:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:56,639 INFO L495 AbstractCegarLoop]: Abstraction has 1699 states and 1993 transitions. [2022-07-23 13:01:56,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1993 transitions. [2022-07-23 13:01:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 13:01:56,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:56,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:56,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:56,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:56,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-23 13:01:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:56,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995017095] [2022-07-23 13:01:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:56,851 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:56,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 13:01:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:57,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:01:57,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:57,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:57,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:57,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995017095] [2022-07-23 13:01:57,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995017095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:57,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:57,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:01:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025476934] [2022-07-23 13:01:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:57,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:01:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:57,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:01:57,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:01:57,063 INFO L87 Difference]: Start difference. First operand 1699 states and 1993 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:57,108 INFO L93 Difference]: Finished difference Result 1699 states and 1989 transitions. [2022-07-23 13:01:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:01:57,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 13:01:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:57,113 INFO L225 Difference]: With dead ends: 1699 [2022-07-23 13:01:57,113 INFO L226 Difference]: Without dead ends: 1699 [2022-07-23 13:01:57,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:01:57,116 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 1480 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:57,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 3060 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:01:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-07-23 13:01:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1693. [2022-07-23 13:01:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 989 states have (on average 1.9726996966632964) internal successors, (1951), 1684 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1983 transitions. [2022-07-23 13:01:57,138 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1983 transitions. Word has length 42 [2022-07-23 13:01:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:57,138 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 1983 transitions. [2022-07-23 13:01:57,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1983 transitions. [2022-07-23 13:01:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 13:01:57,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:57,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:57,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-23 13:01:57,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:57,350 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-23 13:01:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:57,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923354956] [2022-07-23 13:01:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:57,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:57,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:57,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:57,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 13:01:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:57,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:01:57,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:57,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:57,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:57,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923354956] [2022-07-23 13:01:57,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923354956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:57,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:57,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:01:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469839539] [2022-07-23 13:01:57,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:01:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:01:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:57,658 INFO L87 Difference]: Start difference. First operand 1693 states and 1983 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:01:57,824 INFO L93 Difference]: Finished difference Result 2112 states and 2419 transitions. [2022-07-23 13:01:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:01:57,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-23 13:01:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:01:57,830 INFO L225 Difference]: With dead ends: 2112 [2022-07-23 13:01:57,830 INFO L226 Difference]: Without dead ends: 2112 [2022-07-23 13:01:57,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:01:57,831 INFO L413 NwaCegarLoop]: 1600 mSDtfsCounter, 455 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:01:57,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2996 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:01:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-07-23 13:01:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1739. [2022-07-23 13:01:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1035 states have (on average 1.9294685990338165) internal successors, (1997), 1730 states have internal predecessors, (1997), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:01:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2029 transitions. [2022-07-23 13:01:57,854 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2029 transitions. Word has length 50 [2022-07-23 13:01:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:01:57,854 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2029 transitions. [2022-07-23 13:01:57,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:01:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2029 transitions. [2022-07-23 13:01:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 13:01:57,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:01:57,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:01:57,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 13:01:58,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:01:58,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:01:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:01:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-23 13:01:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:01:58,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993353262] [2022-07-23 13:01:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:01:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:01:58,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:01:58,068 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:01:58,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 13:01:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:01:58,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 13:01:58,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:01:58,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:01:58,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:01:58,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 13:01:58,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 13:01:58,621 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 13:01:58,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 13:01:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:01:58,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:01:58,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:01:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993353262] [2022-07-23 13:01:58,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993353262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:01:58,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:01:58,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:01:58,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873028929] [2022-07-23 13:01:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:01:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:01:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:01:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:01:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:01:58,635 INFO L87 Difference]: Start difference. First operand 1739 states and 2029 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:02:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:01,046 INFO L93 Difference]: Finished difference Result 1708 states and 1952 transitions. [2022-07-23 13:02:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:02:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-23 13:02:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:01,051 INFO L225 Difference]: With dead ends: 1708 [2022-07-23 13:02:01,051 INFO L226 Difference]: Without dead ends: 1708 [2022-07-23 13:02:01,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:02:01,052 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 1095 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:01,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1218 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 13:02:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-07-23 13:02:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1489. [2022-07-23 13:02:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 869 states have (on average 1.8365937859608745) internal successors, (1596), 1480 states have internal predecessors, (1596), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:02:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1628 transitions. [2022-07-23 13:02:01,071 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1628 transitions. Word has length 53 [2022-07-23 13:02:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:01,072 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1628 transitions. [2022-07-23 13:02:01,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:02:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1628 transitions. [2022-07-23 13:02:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 13:02:01,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:01,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:01,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:01,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:01,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-23 13:02:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:01,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346279865] [2022-07-23 13:02:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:02:01,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:01,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:01,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 13:02:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:02:01,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 13:02:01,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:01,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:02:01,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:02:01,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 13:02:01,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-23 13:02:01,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:02:01,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:01,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346279865] [2022-07-23 13:02:01,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346279865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:02:01,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:02:01,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:02:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791298455] [2022-07-23 13:02:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:02:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:02:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:02:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:02:01,560 INFO L87 Difference]: Start difference. First operand 1489 states and 1628 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:02:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:04,046 INFO L93 Difference]: Finished difference Result 1488 states and 1627 transitions. [2022-07-23 13:02:04,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 13:02:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 13:02:04,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:04,050 INFO L225 Difference]: With dead ends: 1488 [2022-07-23 13:02:04,050 INFO L226 Difference]: Without dead ends: 1488 [2022-07-23 13:02:04,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:02:04,051 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 4 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:04,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3630 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 13:02:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-23 13:02:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-07-23 13:02:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 869 states have (on average 1.8354430379746836) internal successors, (1595), 1479 states have internal predecessors, (1595), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:02:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1627 transitions. [2022-07-23 13:02:04,067 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1627 transitions. Word has length 58 [2022-07-23 13:02:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:04,068 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1627 transitions. [2022-07-23 13:02:04,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:02:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1627 transitions. [2022-07-23 13:02:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 13:02:04,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:04,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:04,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:04,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:04,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-23 13:02:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:04,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722244376] [2022-07-23 13:02:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:02:04,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:04,283 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:04,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 13:02:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:02:04,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 13:02:04,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:04,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:02:04,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:02:04,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:02:04,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 13:02:04,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 13:02:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:04,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:02:04,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:04,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722244376] [2022-07-23 13:02:04,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722244376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:02:04,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:02:04,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:02:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811340216] [2022-07-23 13:02:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:02:04,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:02:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:02:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:02:04,598 INFO L87 Difference]: Start difference. First operand 1488 states and 1627 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:02:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:07,802 INFO L93 Difference]: Finished difference Result 1487 states and 1626 transitions. [2022-07-23 13:02:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 13:02:07,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 13:02:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:07,806 INFO L225 Difference]: With dead ends: 1487 [2022-07-23 13:02:07,806 INFO L226 Difference]: Without dead ends: 1487 [2022-07-23 13:02:07,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:02:07,806 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:07,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3681 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 13:02:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-23 13:02:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2022-07-23 13:02:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 868 states have (on average 1.836405529953917) internal successors, (1594), 1478 states have internal predecessors, (1594), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-23 13:02:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1626 transitions. [2022-07-23 13:02:07,822 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1626 transitions. Word has length 58 [2022-07-23 13:02:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:07,822 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 1626 transitions. [2022-07-23 13:02:07,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:02:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1626 transitions. [2022-07-23 13:02:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 13:02:07,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:07,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:07,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:08,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:08,034 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1222950270, now seen corresponding path program 1 times [2022-07-23 13:02:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727387789] [2022-07-23 13:02:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:02:08,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:08,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:08,037 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:08,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 13:02:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:02:08,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:02:08,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:08,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:02:08,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:08,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727387789] [2022-07-23 13:02:08,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727387789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:02:08,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:02:08,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:02:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862749089] [2022-07-23 13:02:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:02:08,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:02:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:08,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:02:08,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:02:08,298 INFO L87 Difference]: Start difference. First operand 1487 states and 1626 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:02:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:08,347 INFO L93 Difference]: Finished difference Result 1490 states and 1631 transitions. [2022-07-23 13:02:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:02:08,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-07-23 13:02:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:08,358 INFO L225 Difference]: With dead ends: 1490 [2022-07-23 13:02:08,358 INFO L226 Difference]: Without dead ends: 1490 [2022-07-23 13:02:08,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:02:08,359 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:08,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:02:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-23 13:02:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2022-07-23 13:02:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 870 states have (on average 1.835632183908046) internal successors, (1597), 1481 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-23 13:02:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1631 transitions. [2022-07-23 13:02:08,377 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1631 transitions. Word has length 66 [2022-07-23 13:02:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:08,378 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 1631 transitions. [2022-07-23 13:02:08,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 13:02:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1631 transitions. [2022-07-23 13:02:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 13:02:08,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:08,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:08,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:08,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:08,583 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash -428715873, now seen corresponding path program 1 times [2022-07-23 13:02:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:08,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783388824] [2022-07-23 13:02:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:02:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:08,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:08,586 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:08,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 13:02:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:02:08,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:02:08,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:08,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:02:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:08,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783388824] [2022-07-23 13:02:08,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783388824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:02:08,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:02:08,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 13:02:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743641842] [2022-07-23 13:02:08,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:02:08,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:02:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:02:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 13:02:08,935 INFO L87 Difference]: Start difference. First operand 1490 states and 1631 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:09,114 INFO L93 Difference]: Finished difference Result 1502 states and 1649 transitions. [2022-07-23 13:02:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:02:09,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-23 13:02:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:09,119 INFO L225 Difference]: With dead ends: 1502 [2022-07-23 13:02:09,119 INFO L226 Difference]: Without dead ends: 1502 [2022-07-23 13:02:09,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-23 13:02:09,120 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 15 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:09,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7178 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:02:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-07-23 13:02:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1500. [2022-07-23 13:02:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 879 states have (on average 1.8339021615472126) internal successors, (1612), 1490 states have internal predecessors, (1612), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-23 13:02:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1646 transitions. [2022-07-23 13:02:09,137 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1646 transitions. Word has length 67 [2022-07-23 13:02:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:09,138 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 1646 transitions. [2022-07-23 13:02:09,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1646 transitions. [2022-07-23 13:02:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 13:02:09,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:09,139 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:09,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:09,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:09,349 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash 155254206, now seen corresponding path program 2 times [2022-07-23 13:02:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:09,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226769682] [2022-07-23 13:02:09,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:02:09,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:09,352 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:09,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 13:02:09,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 13:02:09,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:02:09,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 13:02:09,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:09,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:02:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:09,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:09,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226769682] [2022-07-23 13:02:09,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226769682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:02:09,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:02:09,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 13:02:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546557611] [2022-07-23 13:02:09,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:02:09,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 13:02:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 13:02:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 13:02:09,968 INFO L87 Difference]: Start difference. First operand 1500 states and 1646 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:10,575 INFO L93 Difference]: Finished difference Result 1521 states and 1678 transitions. [2022-07-23 13:02:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 13:02:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-23 13:02:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:10,579 INFO L225 Difference]: With dead ends: 1521 [2022-07-23 13:02:10,579 INFO L226 Difference]: Without dead ends: 1517 [2022-07-23 13:02:10,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-23 13:02:10,579 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 44 mSDsluCounter, 11498 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:10,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12942 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 13:02:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2022-07-23 13:02:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2022-07-23 13:02:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 888 states have (on average 1.8288288288288288) internal successors, (1624), 1499 states have internal predecessors, (1624), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-23 13:02:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1658 transitions. [2022-07-23 13:02:10,594 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1658 transitions. Word has length 70 [2022-07-23 13:02:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:10,594 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1658 transitions. [2022-07-23 13:02:10,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1658 transitions. [2022-07-23 13:02:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 13:02:10,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:10,595 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:10,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:10,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:10,805 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash -392207842, now seen corresponding path program 3 times [2022-07-23 13:02:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306899906] [2022-07-23 13:02:10,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 13:02:10,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:10,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:10,808 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:10,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 13:02:11,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 13:02:11,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:02:11,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 13:02:11,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:11,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:02:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:12,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:12,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306899906] [2022-07-23 13:02:12,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306899906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:02:12,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:02:12,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 13:02:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508625730] [2022-07-23 13:02:12,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:02:12,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 13:02:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:12,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 13:02:12,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 13:02:12,091 INFO L87 Difference]: Start difference. First operand 1509 states and 1658 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:14,694 INFO L93 Difference]: Finished difference Result 1551 states and 1734 transitions. [2022-07-23 13:02:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 13:02:14,695 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-23 13:02:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:14,698 INFO L225 Difference]: With dead ends: 1551 [2022-07-23 13:02:14,698 INFO L226 Difference]: Without dead ends: 1545 [2022-07-23 13:02:14,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 13:02:14,699 INFO L413 NwaCegarLoop]: 1448 mSDtfsCounter, 162 mSDsluCounter, 15872 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 17320 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:14,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 17320 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 13:02:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-07-23 13:02:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1527. [2022-07-23 13:02:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 906 states have (on average 1.8178807947019868) internal successors, (1647), 1517 states have internal predecessors, (1647), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-23 13:02:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1681 transitions. [2022-07-23 13:02:14,728 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1681 transitions. Word has length 76 [2022-07-23 13:02:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:14,728 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 1681 transitions. [2022-07-23 13:02:14,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1681 transitions. [2022-07-23 13:02:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 13:02:14,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:14,729 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:14,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:14,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:14,958 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:14,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1896075998, now seen corresponding path program 4 times [2022-07-23 13:02:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:14,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464835808] [2022-07-23 13:02:14,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 13:02:14,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:14,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:14,977 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:14,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 13:02:15,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 13:02:15,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:02:15,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 13:02:15,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:15,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:02:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:02:16,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464835808] [2022-07-23 13:02:16,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464835808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:02:16,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:02:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 13:02:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235874898] [2022-07-23 13:02:16,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:02:16,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 13:02:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:02:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 13:02:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 13:02:16,898 INFO L87 Difference]: Start difference. First operand 1527 states and 1681 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:02:27,131 INFO L93 Difference]: Finished difference Result 1607 states and 1814 transitions. [2022-07-23 13:02:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 13:02:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-23 13:02:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:02:27,135 INFO L225 Difference]: With dead ends: 1607 [2022-07-23 13:02:27,135 INFO L226 Difference]: Without dead ends: 1603 [2022-07-23 13:02:27,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 13:02:27,138 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 416 mSDsluCounter, 34926 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 36387 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-23 13:02:27,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 36387 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-23 13:02:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2022-07-23 13:02:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1561. [2022-07-23 13:02:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 940 states have (on average 1.8010638297872341) internal successors, (1693), 1551 states have internal predecessors, (1693), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-23 13:02:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1727 transitions. [2022-07-23 13:02:27,171 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1727 transitions. Word has length 88 [2022-07-23 13:02:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:02:27,172 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1727 transitions. [2022-07-23 13:02:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 13:02:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1727 transitions. [2022-07-23 13:02:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 13:02:27,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:02:27,173 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:02:27,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 13:02:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:02:27,384 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:02:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:02:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 202285118, now seen corresponding path program 5 times [2022-07-23 13:02:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:02:27,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300326549] [2022-07-23 13:02:27,386 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 13:02:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:02:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:02:27,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:02:27,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 13:02:28,721 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 13:02:28,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:02:28,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 13:02:28,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:02:28,790 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 13:02:28,790 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 21 [2022-07-23 13:02:29,040 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 13:02:29,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-23 13:02:29,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:02:29,193 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 43 treesize of output 25 [2022-07-23 13:02:29,469 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1564)))) is different from true [2022-07-23 13:02:29,565 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1568) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:02:29,797 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1575)))) is different from true [2022-07-23 13:02:29,882 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1578)))) is different from true [2022-07-23 13:02:29,920 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1580) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:02:29,956 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-07-23 13:02:30,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1583)))) is different from true [2022-07-23 13:02:30,017 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1584)))) is different from true [2022-07-23 13:02:30,147 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1590) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:02:30,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1591)))) is different from true [2022-07-23 13:02:30,166 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1592) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:02:30,327 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1599) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:02:30,336 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:02:30,391 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1603)))) is different from true [2022-07-23 13:02:30,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:02:30,470 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 55 treesize of output 54 [2022-07-23 13:02:30,510 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 52 treesize of output 28 [2022-07-23 13:02:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 525 not checked. [2022-07-23 13:02:30,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:02:30,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 13:02:30,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:02:30,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300326549] [2022-07-23 13:02:30,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300326549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:02:30,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [863472910] [2022-07-23 13:02:30,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 13:02:30,719 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 13:02:30,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 13:02:30,736 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 13:02:30,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-23 13:03:56,196 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 13:03:56,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:03:56,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 13:03:56,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:03:56,445 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 13:03:56,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 13:03:56,609 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 13:03:56,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-23 13:03:56,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:03:56,771 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 32 treesize of output 14 [2022-07-23 13:03:58,684 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:03:58,684 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 44 treesize of output 43 [2022-07-23 13:03:58,732 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 41 treesize of output 17 [2022-07-23 13:03:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-23 13:03:58,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:03:58,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 13:03:58,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [863472910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:03:58,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:03:58,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 30 [2022-07-23 13:03:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503589850] [2022-07-23 13:03:58,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:03:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 13:03:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:03:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 13:03:58,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=316, Unknown=38, NotChecked=816, Total=1260 [2022-07-23 13:03:58,938 INFO L87 Difference]: Start difference. First operand 1561 states and 1727 transitions. Second operand has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 31 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 13:04:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:07,497 INFO L93 Difference]: Finished difference Result 2846 states and 3093 transitions. [2022-07-23 13:04:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 13:04:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 31 states have internal predecessors, (155), 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) Word has length 110 [2022-07-23 13:04:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:07,502 INFO L225 Difference]: With dead ends: 2846 [2022-07-23 13:04:07,502 INFO L226 Difference]: Without dead ends: 2842 [2022-07-23 13:04:07,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 120 SyntacticMatches, 75 SemanticMatches, 45 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=197, Invalid=739, Unknown=58, NotChecked=1168, Total=2162 [2022-07-23 13:04:07,503 INFO L413 NwaCegarLoop]: 1004 mSDtfsCounter, 1376 mSDsluCounter, 8079 mSDsCounter, 0 mSdLazyCounter, 6890 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 9083 SdHoareTripleChecker+Invalid, 35816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 6890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28891 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:07,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 9083 Invalid, 35816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 6890 Invalid, 0 Unknown, 28891 Unchecked, 7.9s Time] [2022-07-23 13:04:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2022-07-23 13:04:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1923. [2022-07-23 13:04:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1300 states have (on average 1.7407692307692308) internal successors, (2263), 1908 states have internal predecessors, (2263), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (22), 11 states have call predecessors, (22), 20 states have call successors, (22) [2022-07-23 13:04:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2305 transitions. [2022-07-23 13:04:07,571 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2305 transitions. Word has length 110 [2022-07-23 13:04:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:07,571 INFO L495 AbstractCegarLoop]: Abstraction has 1923 states and 2305 transitions. [2022-07-23 13:04:07,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 31 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 13:04:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2305 transitions. [2022-07-23 13:04:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 13:04:07,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:07,574 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:07,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 13:04:07,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-07-23 13:04:07,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 13:04:07,975 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-23 13:04:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 202285119, now seen corresponding path program 1 times [2022-07-23 13:04:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:07,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146560242] [2022-07-23 13:04:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:07,978 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:04:07,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 13:04:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:08,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-23 13:04:08,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:08,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:04:08,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 13:04:08,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 13:04:08,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:04:08,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:04:08,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 13:04:09,039 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 18 treesize of output 10 [2022-07-23 13:04:09,043 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 7 treesize of output 3 [2022-07-23 13:04:09,077 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-07-23 13:04:09,130 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463)))) is different from true [2022-07-23 13:04:09,142 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-07-23 13:04:09,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,175 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,182 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471)))) is different from true [2022-07-23 13:04:09,189 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-23 13:04:09,196 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,202 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477)))) is different from true [2022-07-23 13:04:09,208 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-07-23 13:04:09,220 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,226 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,239 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-23 13:04:09,245 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,250 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,273 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491)))) is different from true [2022-07-23 13:04:09,280 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-23 13:04:09,295 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,311 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498)))) is different from true [2022-07-23 13:04:09,318 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-23 13:04:09,325 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-23 13:04:09,332 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,339 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,346 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,352 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-23 13:04:09,359 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-23 13:04:09,366 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,383 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517)))) is different from true [2022-07-23 13:04:09,390 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-23 13:04:09,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-23 13:04:09,404 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,413 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,420 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-23 13:04:09,426 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:04:09,433 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-23 13:04:09,440 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,447 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-23 13:04:09,454 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-23 13:04:09,461 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,468 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,483 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:04:09,507 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:04:09,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 13:04:09,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 13:04:09,555 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 25 treesize of output 13 [2022-07-23 13:04:09,561 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 15 treesize of output 7 [2022-07-23 13:04:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-07-23 13:04:09,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:04:10,189 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-23 13:04:10,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:10,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146560242] [2022-07-23 13:04:10,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146560242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:04:10,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375902549] [2022-07-23 13:04:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:10,195 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 13:04:10,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 13:04:10,196 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 13:04:10,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process