./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_dsw.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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:21:25,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:21:25,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:21:25,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:21:25,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:21:25,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:21:25,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:21:25,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:21:25,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:21:25,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:21:25,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:21:25,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:21:25,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:21:25,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:21:25,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:21:25,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:21:25,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:21:25,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:21:25,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:21:25,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:21:25,383 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:21:25,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:21:25,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:21:25,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:21:25,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:21:25,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:21:25,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:21:25,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:21:25,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:21:25,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:21:25,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:21:25,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:21:25,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:21:25,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:21:25,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:21:25,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:21:25,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:21:25,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:21:25,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:21:25,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:21:25,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:21:25,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:21:25,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:21:25,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:21:25,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:21:25,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:21:25,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:21:25,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:21:25,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:21:25,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:21:25,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:21:25,433 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:21:25,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:21:25,434 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:21:25,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:21:25,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:21:25,436 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:21:25,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:21:25,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:21:25,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:21:25,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:21:25,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:21:25,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:25,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:21:25,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:21:25,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:21:25,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:21:25,437 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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2022-07-14 06:21:25,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:21:25,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:21:25,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:21:25,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:21:25,664 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:21:25,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-07-14 06:21:25,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77532bceb/51e00fb5cec24a738ab7dbf40a0d5921/FLAGacb8cc95c [2022-07-14 06:21:26,159 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:21:26,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-07-14 06:21:26,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77532bceb/51e00fb5cec24a738ab7dbf40a0d5921/FLAGacb8cc95c [2022-07-14 06:21:26,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77532bceb/51e00fb5cec24a738ab7dbf40a0d5921 [2022-07-14 06:21:26,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:21:26,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:21:26,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:26,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:21:26,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:21:26,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:26" (1/1) ... [2022-07-14 06:21:26,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7147b7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:26, skipping insertion in model container [2022-07-14 06:21:26,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:26" (1/1) ... [2022-07-14 06:21:26,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:21:26,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:21:26,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:26,512 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 06:21:26,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fc77e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:26, skipping insertion in model container [2022-07-14 06:21:26,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:26,515 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 06:21:26,518 INFO L158 Benchmark]: Toolchain (without parser) took 329.37ms. Allocated memory was 102.8MB in the beginning and 140.5MB in the end (delta: 37.7MB). Free memory was 73.8MB in the beginning and 112.8MB in the end (delta: -39.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 06:21:26,518 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:21:26,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.66ms. Allocated memory was 102.8MB in the beginning and 140.5MB in the end (delta: 37.7MB). Free memory was 73.6MB in the beginning and 112.8MB in the end (delta: -39.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 06:21:26,522 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.16ms. Allocated memory is still 102.8MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.66ms. Allocated memory was 102.8MB in the beginning and 140.5MB in the end (delta: 37.7MB). Free memory was 73.6MB in the beginning and 112.8MB in the end (delta: -39.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 571]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_dsw.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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:21:27,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:21:27,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:21:28,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:21:28,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:21:28,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:21:28,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:21:28,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:21:28,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:21:28,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:21:28,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:21:28,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:21:28,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:21:28,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:21:28,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:21:28,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:21:28,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:21:28,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:21:28,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:21:28,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:21:28,051 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:21:28,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:21:28,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:21:28,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:21:28,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:21:28,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:21:28,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:21:28,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:21:28,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:21:28,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:21:28,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:21:28,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:21:28,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:21:28,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:21:28,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:21:28,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:21:28,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:21:28,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:21:28,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:21:28,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:21:28,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:21:28,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:21:28,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:21:28,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:21:28,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:21:28,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:21:28,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:21:28,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:21:28,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:21:28,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:21:28,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:21:28,116 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:21:28,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:21:28,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:21:28,116 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:21:28,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:21:28,118 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:21:28,118 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:21:28,118 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:21:28,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:21:28,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:21:28,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:21:28,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:21:28,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:21:28,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:28,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:21:28,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:21:28,119 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:21:28,120 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:21:28,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:21:28,120 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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2022-07-14 06:21:28,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:21:28,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:21:28,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:21:28,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:21:28,415 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:21:28,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-07-14 06:21:28,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71265c84a/e3681dd87c2248fea6133fca2e548bf2/FLAG491127d65 [2022-07-14 06:21:28,888 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:21:28,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-07-14 06:21:28,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71265c84a/e3681dd87c2248fea6133fca2e548bf2/FLAG491127d65 [2022-07-14 06:21:29,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71265c84a/e3681dd87c2248fea6133fca2e548bf2 [2022-07-14 06:21:29,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:21:29,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:21:29,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:29,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:21:29,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:21:29,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d60b187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29, skipping insertion in model container [2022-07-14 06:21:29,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:21:29,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:21:29,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:29,629 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 06:21:29,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:21:29,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:29,685 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:21:29,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:29,753 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:21:29,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29 WrapperNode [2022-07-14 06:21:29,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:29,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:21:29,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:21:29,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:21:29,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,799 INFO L137 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-07-14 06:21:29,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:21:29,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:21:29,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:21:29,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:21:29,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:21:29,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:21:29,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:21:29,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:21:29,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (1/1) ... [2022-07-14 06:21:29,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:29,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:21:29,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:21:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:21:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:21:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:21:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:21:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:21:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:21:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:21:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:21:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:21:30,005 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:21:30,020 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:21:30,629 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:21:30,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:21:30,637 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 06:21:30,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:21:30 BoogieIcfgContainer [2022-07-14 06:21:30,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:21:30,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:21:30,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:21:30,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:21:30,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:21:29" (1/3) ... [2022-07-14 06:21:30,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8d1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:21:30, skipping insertion in model container [2022-07-14 06:21:30,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:29" (2/3) ... [2022-07-14 06:21:30,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8d1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:21:30, skipping insertion in model container [2022-07-14 06:21:30,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:21:30" (3/3) ... [2022-07-14 06:21:30,648 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2022-07-14 06:21:30,659 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:21:30,659 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-07-14 06:21:30,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:21:30,709 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@3b415317, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b8d084f [2022-07-14 06:21:30,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-07-14 06:21:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 77 states have (on average 2.207792207792208) internal successors, (170), 154 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:21:30,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:30,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:21:30,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:30,727 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:21:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851226216] [2022-07-14 06:21:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:30,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:30,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:30,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:30,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:21:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:30,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:21:30,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:30,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:30,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:30,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:30,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851226216] [2022-07-14 06:21:30,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851226216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:30,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:30,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:21:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367263877] [2022-07-14 06:21:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:30,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:30,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:30,916 INFO L87 Difference]: Start difference. First operand has 155 states, 77 states have (on average 2.207792207792208) internal successors, (170), 154 states have internal predecessors, (170), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:31,156 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-07-14 06:21:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:31,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:21:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:31,164 INFO L225 Difference]: With dead ends: 169 [2022-07-14 06:21:31,166 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:21:31,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:31,175 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:31,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 127 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:21:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2022-07-14 06:21:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 76 states have (on average 2.1315789473684212) internal successors, (162), 150 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-14 06:21:31,222 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-14 06:21:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:31,223 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-14 06:21:31,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-14 06:21:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:21:31,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:31,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:21:31,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 06:21:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:31,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:21:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:31,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061922536] [2022-07-14 06:21:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:31,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:31,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:31,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:21:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:31,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:21:31,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:31,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:31,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:31,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061922536] [2022-07-14 06:21:31,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061922536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:31,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:31,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:21:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172324499] [2022-07-14 06:21:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:31,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:31,487 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:31,678 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-14 06:21:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:31,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:21:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:31,680 INFO L225 Difference]: With dead ends: 149 [2022-07-14 06:21:31,680 INFO L226 Difference]: Without dead ends: 149 [2022-07-14 06:21:31,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:31,681 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:31,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 83 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-14 06:21:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-07-14 06:21:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-07-14 06:21:31,686 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 3 [2022-07-14 06:21:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:31,687 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-07-14 06:21:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-07-14 06:21:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:21:31,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:31,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:21:31,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:31,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:31,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2022-07-14 06:21:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:31,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252390258] [2022-07-14 06:21:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:31,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:31,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:31,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:21:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:31,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:21:31,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:31,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:31,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:31,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:31,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252390258] [2022-07-14 06:21:31,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252390258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:31,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:31,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082776803] [2022-07-14 06:21:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:31,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:31,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:31,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:31,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:31,972 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-14 06:21:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:32,246 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2022-07-14 06:21:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:21:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-14 06:21:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:32,248 INFO L225 Difference]: With dead ends: 159 [2022-07-14 06:21:32,248 INFO L226 Difference]: Without dead ends: 159 [2022-07-14 06:21:32,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:32,249 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 205 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:32,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 91 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-14 06:21:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2022-07-14 06:21:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 133 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-07-14 06:21:32,255 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 6 [2022-07-14 06:21:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:32,255 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-07-14 06:21:32,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-14 06:21:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-07-14 06:21:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:21:32,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:32,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:21:32,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:32,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:32,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2022-07-14 06:21:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:32,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062028334] [2022-07-14 06:21:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:32,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:32,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:21:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:32,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:21:32,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:32,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:32,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:32,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062028334] [2022-07-14 06:21:32,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062028334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:32,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:32,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71595376] [2022-07-14 06:21:32,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:32,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:32,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:32,544 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-14 06:21:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:32,889 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-07-14 06:21:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:21:32,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-14 06:21:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:32,892 INFO L225 Difference]: With dead ends: 185 [2022-07-14 06:21:32,892 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 06:21:32,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:32,894 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 241 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:32,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 110 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 06:21:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2022-07-14 06:21:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.709090909090909) internal successors, (188), 164 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2022-07-14 06:21:32,901 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 6 [2022-07-14 06:21:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:32,901 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2022-07-14 06:21:32,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-14 06:21:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2022-07-14 06:21:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:21:32,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:32,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:32,909 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-14 06:21:33,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:33,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826674, now seen corresponding path program 1 times [2022-07-14 06:21:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:33,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328512955] [2022-07-14 06:21:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:33,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:33,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:33,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:33,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:21:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:33,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:21:33,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:33,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:33,212 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:33,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:21:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:33,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:33,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:33,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328512955] [2022-07-14 06:21:33,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328512955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:33,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:33,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960827959] [2022-07-14 06:21:33,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:33,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:33,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:33,224 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:33,476 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-07-14 06:21:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:21:33,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-07-14 06:21:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:33,477 INFO L225 Difference]: With dead ends: 182 [2022-07-14 06:21:33,477 INFO L226 Difference]: Without dead ends: 182 [2022-07-14 06:21:33,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:33,477 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 112 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:33,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 175 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-14 06:21:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-07-14 06:21:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.7) internal successors, (187), 164 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2022-07-14 06:21:33,484 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 9 [2022-07-14 06:21:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:33,484 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2022-07-14 06:21:33,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2022-07-14 06:21:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:21:33,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:33,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:33,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:33,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:33,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2022-07-14 06:21:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609906710] [2022-07-14 06:21:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:33,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:33,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:33,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:33,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:21:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:33,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:21:33,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:33,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:33,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:33,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609906710] [2022-07-14 06:21:33,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609906710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:33,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:33,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292979829] [2022-07-14 06:21:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:33,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:33,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:33,759 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:33,766 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2022-07-14 06:21:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:33,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:21:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:33,768 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:21:33,768 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:21:33,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:33,768 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:33,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:21:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:21:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-14 06:21:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.6875) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-07-14 06:21:33,773 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 13 [2022-07-14 06:21:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:33,773 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-07-14 06:21:33,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-07-14 06:21:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:21:33,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:33,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:33,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:33,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:33,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash 131239230, now seen corresponding path program 1 times [2022-07-14 06:21:33,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:33,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460534328] [2022-07-14 06:21:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:33,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:33,977 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:33,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:21:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:34,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:21:34,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:34,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:34,063 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 11 treesize of output 7 [2022-07-14 06:21:34,074 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 17 treesize of output 9 [2022-07-14 06:21:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:34,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:34,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460534328] [2022-07-14 06:21:34,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460534328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:34,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:34,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456181012] [2022-07-14 06:21:34,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:34,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:34,087 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:34,396 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2022-07-14 06:21:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:21:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:34,398 INFO L225 Difference]: With dead ends: 166 [2022-07-14 06:21:34,398 INFO L226 Difference]: Without dead ends: 166 [2022-07-14 06:21:34,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:34,398 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:34,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 328 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-14 06:21:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-14 06:21:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 112 states have (on average 1.6696428571428572) internal successors, (187), 165 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2022-07-14 06:21:34,402 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 15 [2022-07-14 06:21:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:34,403 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2022-07-14 06:21:34,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2022-07-14 06:21:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:21:34,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:34,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:34,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-14 06:21:34,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:34,610 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash 131239231, now seen corresponding path program 1 times [2022-07-14 06:21:34,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:34,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55048753] [2022-07-14 06:21:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:34,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:34,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:34,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:34,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:21:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:34,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:21:34,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:34,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:34,713 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 11 treesize of output 7 [2022-07-14 06:21:34,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:21:34,735 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 17 treesize of output 9 [2022-07-14 06:21:34,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:21:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:34,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:34,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:34,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55048753] [2022-07-14 06:21:34,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55048753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:34,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:34,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555903762] [2022-07-14 06:21:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:34,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:34,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:34,766 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:35,115 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-07-14 06:21:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:35,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:21:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:35,116 INFO L225 Difference]: With dead ends: 165 [2022-07-14 06:21:35,116 INFO L226 Difference]: Without dead ends: 165 [2022-07-14 06:21:35,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:35,117 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 4 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:35,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 310 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-14 06:21:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-14 06:21:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 164 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2022-07-14 06:21:35,120 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 15 [2022-07-14 06:21:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:35,120 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2022-07-14 06:21:35,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2022-07-14 06:21:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:21:35,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:35,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:35,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:35,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:35,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2022-07-14 06:21:35,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:35,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333076169] [2022-07-14 06:21:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:35,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:35,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:35,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:35,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:21:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:35,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:21:35,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:35,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:35,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:35,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:21:35,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:21:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:35,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:35,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:35,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333076169] [2022-07-14 06:21:35,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333076169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:35,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:35,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:21:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994984256] [2022-07-14 06:21:35,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:35,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:35,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:35,467 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:35,850 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2022-07-14 06:21:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:21:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:35,851 INFO L225 Difference]: With dead ends: 203 [2022-07-14 06:21:35,851 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 06:21:35,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:21:35,852 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:35,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 523 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 06:21:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2022-07-14 06:21:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 123 states have (on average 1.6260162601626016) internal successors, (200), 175 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2022-07-14 06:21:35,855 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 15 [2022-07-14 06:21:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:35,855 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2022-07-14 06:21:35,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2022-07-14 06:21:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:35,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:35,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:35,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:36,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:36,064 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:36,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751881, now seen corresponding path program 1 times [2022-07-14 06:21:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:36,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105176139] [2022-07-14 06:21:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:36,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:36,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:36,066 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:36,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:21:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:36,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:21:36,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:36,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:36,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:36,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 06:21:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:36,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:36,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:36,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105176139] [2022-07-14 06:21:36,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105176139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:36,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:36,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185563628] [2022-07-14 06:21:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:36,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:36,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:36,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:36,160 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:36,455 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-07-14 06:21:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:36,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-14 06:21:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:36,457 INFO L225 Difference]: With dead ends: 175 [2022-07-14 06:21:36,457 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 06:21:36,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:36,457 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:36,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 323 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 06:21:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-14 06:21:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 123 states have (on average 1.6097560975609757) internal successors, (198), 174 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2022-07-14 06:21:36,460 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 17 [2022-07-14 06:21:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:36,460 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2022-07-14 06:21:36,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2022-07-14 06:21:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:36,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:36,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:36,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:36,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:36,668 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751880, now seen corresponding path program 1 times [2022-07-14 06:21:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:36,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827520276] [2022-07-14 06:21:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:36,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:36,670 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:36,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:21:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:36,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:21:36,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:36,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:36,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:36,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:36,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 06:21:36,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:21:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:36,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:36,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827520276] [2022-07-14 06:21:36,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827520276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:36,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:21:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376681085] [2022-07-14 06:21:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:36,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:21:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:21:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:36,816 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:37,159 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2022-07-14 06:21:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:21:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-14 06:21:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:37,160 INFO L225 Difference]: With dead ends: 174 [2022-07-14 06:21:37,160 INFO L226 Difference]: Without dead ends: 174 [2022-07-14 06:21:37,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:37,161 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:37,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 305 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-14 06:21:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-07-14 06:21:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.5934959349593496) internal successors, (196), 173 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2022-07-14 06:21:37,164 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 17 [2022-07-14 06:21:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:37,164 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2022-07-14 06:21:37,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2022-07-14 06:21:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:37,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:37,165 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:37,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-14 06:21:37,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:37,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1696190880, now seen corresponding path program 1 times [2022-07-14 06:21:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:37,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140305275] [2022-07-14 06:21:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:37,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:37,374 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:37,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:21:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:37,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:21:37,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:37,477 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 11 treesize of output 7 [2022-07-14 06:21:37,484 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 11 treesize of output 7 [2022-07-14 06:21:37,510 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:21:37,510 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:21:37,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:37,520 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 21 treesize of output 20 [2022-07-14 06:21:37,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:21:37,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 15 treesize of output 7 [2022-07-14 06:21:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:37,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:37,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:37,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140305275] [2022-07-14 06:21:37,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140305275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:37,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:37,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:37,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276130556] [2022-07-14 06:21:37,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:21:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:21:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:37,600 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:37,980 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2022-07-14 06:21:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:21:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-07-14 06:21:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:37,982 INFO L225 Difference]: With dead ends: 287 [2022-07-14 06:21:37,982 INFO L226 Difference]: Without dead ends: 287 [2022-07-14 06:21:37,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:21:37,982 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 158 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:37,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 588 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-14 06:21:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 184. [2022-07-14 06:21:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-14 06:21:37,986 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 17 [2022-07-14 06:21:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:37,986 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-14 06:21:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-14 06:21:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:37,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:37,987 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:38,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:38,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:38,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188958, now seen corresponding path program 1 times [2022-07-14 06:21:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:38,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155050229] [2022-07-14 06:21:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:38,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:38,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:21:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:38,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:21:38,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:38,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:38,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155050229] [2022-07-14 06:21:38,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155050229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:38,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:38,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335107832] [2022-07-14 06:21:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:38,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:38,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:38,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:38,283 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:38,548 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-07-14 06:21:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:21:38,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-07-14 06:21:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:38,550 INFO L225 Difference]: With dead ends: 225 [2022-07-14 06:21:38,550 INFO L226 Difference]: Without dead ends: 225 [2022-07-14 06:21:38,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:21:38,550 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 132 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:38,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 166 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:21:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-14 06:21:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2022-07-14 06:21:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 185 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2022-07-14 06:21:38,553 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 17 [2022-07-14 06:21:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:38,554 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2022-07-14 06:21:38,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2022-07-14 06:21:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:21:38,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:38,554 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:38,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:38,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:38,761 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:38,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188959, now seen corresponding path program 1 times [2022-07-14 06:21:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:38,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689520981] [2022-07-14 06:21:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:38,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:38,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:38,763 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:38,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:21:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:38,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:21:38,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:38,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:38,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:38,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689520981] [2022-07-14 06:21:38,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689520981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:38,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:38,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:21:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495450402] [2022-07-14 06:21:38,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:38,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:21:38,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:21:38,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:21:38,904 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:39,414 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2022-07-14 06:21:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:21:39,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-07-14 06:21:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:39,416 INFO L225 Difference]: With dead ends: 302 [2022-07-14 06:21:39,416 INFO L226 Difference]: Without dead ends: 302 [2022-07-14 06:21:39,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:21:39,416 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 402 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:39,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 306 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:21:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-14 06:21:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 189. [2022-07-14 06:21:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.5579710144927537) internal successors, (215), 188 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2022-07-14 06:21:39,420 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 17 [2022-07-14 06:21:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:39,420 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2022-07-14 06:21:39,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2022-07-14 06:21:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:21:39,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:39,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:39,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:39,628 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705298, now seen corresponding path program 1 times [2022-07-14 06:21:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:39,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380626633] [2022-07-14 06:21:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:39,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:39,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:39,631 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:39,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:21:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:39,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:21:39,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:39,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:39,741 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:39,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:21:39,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:39,786 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 11 treesize of output 7 [2022-07-14 06:21:39,792 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 11 treesize of output 7 [2022-07-14 06:21:39,850 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:39,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:21:39,855 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 18 treesize of output 20 [2022-07-14 06:21:39,870 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-14 06:21:39,875 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-14 06:21:39,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-14 06:21:39,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:39,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:39,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380626633] [2022-07-14 06:21:39,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380626633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:39,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:39,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182232260] [2022-07-14 06:21:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:39,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:21:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:21:39,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:39,891 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:40,463 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2022-07-14 06:21:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:21:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:21:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:40,464 INFO L225 Difference]: With dead ends: 207 [2022-07-14 06:21:40,464 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 06:21:40,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:21:40,465 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 178 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:40,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 195 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:21:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 06:21:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2022-07-14 06:21:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 187 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2022-07-14 06:21:40,467 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 18 [2022-07-14 06:21:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:40,468 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2022-07-14 06:21:40,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2022-07-14 06:21:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:21:40,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:40,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:40,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:40,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:40,679 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705297, now seen corresponding path program 1 times [2022-07-14 06:21:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:40,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340477231] [2022-07-14 06:21:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:40,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:40,688 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:40,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:21:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:40,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:21:40,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:40,787 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:21:40,788 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-14 06:21:40,867 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 06:21:40,868 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-14 06:21:40,933 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 11 treesize of output 7 [2022-07-14 06:21:41,082 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:41,083 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-14 06:21:41,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-14 06:21:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:41,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:41,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:41,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340477231] [2022-07-14 06:21:41,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340477231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:41,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:41,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587010576] [2022-07-14 06:21:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:41,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:21:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:41,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:21:41,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:21:41,218 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:41,666 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2022-07-14 06:21:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:21:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:21:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:41,667 INFO L225 Difference]: With dead ends: 206 [2022-07-14 06:21:41,667 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 06:21:41,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:21:41,668 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 312 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:41,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 220 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 150 Invalid, 0 Unknown, 299 Unchecked, 0.2s Time] [2022-07-14 06:21:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 06:21:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2022-07-14 06:21:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 138 states have (on average 1.5217391304347827) internal successors, (210), 186 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-07-14 06:21:41,670 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 18 [2022-07-14 06:21:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:41,670 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-07-14 06:21:41,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-07-14 06:21:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:21:41,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:41,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:41,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:41,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:41,878 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1042249152, now seen corresponding path program 1 times [2022-07-14 06:21:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:41,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650329765] [2022-07-14 06:21:41,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:41,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:41,880 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:41,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:21:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:41,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:21:41,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:41,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:42,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:42,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650329765] [2022-07-14 06:21:42,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650329765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:42,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:21:42,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-14 06:21:42,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986158673] [2022-07-14 06:21:42,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:42,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:21:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:42,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:21:42,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:21:42,014 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:42,317 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2022-07-14 06:21:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:21:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:21:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:42,319 INFO L225 Difference]: With dead ends: 264 [2022-07-14 06:21:42,319 INFO L226 Difference]: Without dead ends: 264 [2022-07-14 06:21:42,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:21:42,319 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 307 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:42,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 467 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:21:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-14 06:21:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 186. [2022-07-14 06:21:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-14 06:21:42,322 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 18 [2022-07-14 06:21:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:42,322 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-14 06:21:42,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-14 06:21:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:21:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:42,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:42,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:42,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:42,531 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350413, now seen corresponding path program 1 times [2022-07-14 06:21:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:42,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724734872] [2022-07-14 06:21:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:42,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:42,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:42,533 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:42,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:21:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:42,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:21:42,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:42,645 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:21:42,645 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-14 06:21:42,731 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 06:21:42,732 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-14 06:21:42,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:42,947 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:42,948 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 52 treesize of output 51 [2022-07-14 06:21:43,033 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 49 treesize of output 25 [2022-07-14 06:21:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:43,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:43,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:43,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724734872] [2022-07-14 06:21:43,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724734872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:43,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:43,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494474162] [2022-07-14 06:21:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:43,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:21:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:21:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:21:43,102 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:43,573 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2022-07-14 06:21:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:21:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:21:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:43,574 INFO L225 Difference]: With dead ends: 205 [2022-07-14 06:21:43,574 INFO L226 Difference]: Without dead ends: 205 [2022-07-14 06:21:43,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:21:43,574 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 309 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:43,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 217 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 150 Invalid, 0 Unknown, 304 Unchecked, 0.2s Time] [2022-07-14 06:21:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-14 06:21:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-07-14 06:21:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 137 states have (on average 1.510948905109489) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-07-14 06:21:43,580 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 20 [2022-07-14 06:21:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:43,581 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-07-14 06:21:43,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-07-14 06:21:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:21:43,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:43,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:43,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:43,790 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350412, now seen corresponding path program 1 times [2022-07-14 06:21:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:43,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135998890] [2022-07-14 06:21:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:43,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:43,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:43,792 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:43,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 06:21:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:43,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:21:43,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:43,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:43,922 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:43,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:21:43,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:43,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:43,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:44,007 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:44,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:21:44,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:21:44,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:21:44,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 06:21:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:44,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:44,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:44,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135998890] [2022-07-14 06:21:44,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135998890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:44,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:44,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:21:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394622001] [2022-07-14 06:21:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:44,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:21:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:21:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:21:44,048 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:44,736 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2022-07-14 06:21:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:21:44,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:21:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:44,737 INFO L225 Difference]: With dead ends: 204 [2022-07-14 06:21:44,737 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 06:21:44,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:21:44,738 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 167 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:44,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 224 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:21:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 06:21:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2022-07-14 06:21:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-14 06:21:44,740 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 20 [2022-07-14 06:21:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:44,740 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-14 06:21:44,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-14 06:21:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:21:44,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:44,741 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:44,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:44,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:44,947 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1776483090, now seen corresponding path program 1 times [2022-07-14 06:21:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426269046] [2022-07-14 06:21:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:44,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:44,949 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:44,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:21:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:45,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:21:45,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:45,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:45,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:45,150 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-14 06:21:45,150 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-07-14 06:21:45,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:45,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-07-14 06:21:45,207 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-14 06:21:45,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 23 [2022-07-14 06:21:45,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:45,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-14 06:21:45,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:21:45,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:21:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:45,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:45,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:45,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426269046] [2022-07-14 06:21:45,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426269046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:45,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:21:45,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-14 06:21:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241417184] [2022-07-14 06:21:45,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:45,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:21:45,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:21:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:21:45,390 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:46,093 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2022-07-14 06:21:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:21:46,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 26 [2022-07-14 06:21:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:46,095 INFO L225 Difference]: With dead ends: 224 [2022-07-14 06:21:46,095 INFO L226 Difference]: Without dead ends: 224 [2022-07-14 06:21:46,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:21:46,095 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:46,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 845 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:21:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-14 06:21:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 193. [2022-07-14 06:21:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2022-07-14 06:21:46,098 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 26 [2022-07-14 06:21:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:46,098 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2022-07-14 06:21:46,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2022-07-14 06:21:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:21:46,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:46,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:46,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:46,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:21:46,304 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:21:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719994, now seen corresponding path program 1 times [2022-07-14 06:21:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:46,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939492190] [2022-07-14 06:21:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:46,306 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:21:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:21:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:46,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:21:46,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:46,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:46,494 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:21:46,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 06:21:46,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:21:46,595 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:46,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:21:46,650 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:46,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:21:48,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 06:21:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:48,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:53,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_538))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_539)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-14 06:21:53,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_538))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_539))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-14 06:21:53,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-14 06:21:53,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 294 treesize of output 255 [2022-07-14 06:21:53,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 220 [2022-07-14 06:21:53,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:53,075 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 220 treesize of output 200 [2022-07-14 06:22:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:14,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:14,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939492190] [2022-07-14 06:22:14,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939492190] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:14,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:14,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-14 06:22:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092309982] [2022-07-14 06:22:14,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:14,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:22:14,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:14,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:22:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=328, Unknown=12, NotChecked=78, Total=506 [2022-07-14 06:22:14,922 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:16,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 06:22:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:38,890 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2022-07-14 06:22:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:22:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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 32 [2022-07-14 06:22:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:38,891 INFO L225 Difference]: With dead ends: 327 [2022-07-14 06:22:38,891 INFO L226 Difference]: Without dead ends: 327 [2022-07-14 06:22:38,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=263, Invalid=653, Unknown=22, NotChecked=118, Total=1056 [2022-07-14 06:22:38,892 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 354 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1191 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:38,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 906 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 992 Invalid, 0 Unknown, 1191 Unchecked, 3.4s Time] [2022-07-14 06:22:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-14 06:22:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 273. [2022-07-14 06:22:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.4690265486725664) internal successors, (332), 272 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 332 transitions. [2022-07-14 06:22:38,897 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 332 transitions. Word has length 32 [2022-07-14 06:22:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:38,897 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 332 transitions. [2022-07-14 06:22:38,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 332 transitions. [2022-07-14 06:22:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:22:38,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:38,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:38,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:39,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:22:39,106 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:22:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719993, now seen corresponding path program 1 times [2022-07-14 06:22:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:39,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740249915] [2022-07-14 06:22:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:39,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:39,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:39,108 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:22:39,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:22:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:39,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:22:39,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:39,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:39,294 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:39,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:22:39,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:39,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:22:39,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:22:39,414 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:39,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:22:39,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:22:39,495 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:39,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:22:39,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:22:39,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:39,608 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-14 06:22:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:39,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:39,955 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-14 06:22:39,983 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) is different from false [2022-07-14 06:22:40,028 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_580))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_581) .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))))) is different from false [2022-07-14 06:22:40,090 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_583))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse7))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_580))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) .cse7)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_581) .cse4 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse5))))))))) is different from false [2022-07-14 06:22:40,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:40,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2022-07-14 06:22:40,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:40,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2022-07-14 06:22:40,173 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 98 treesize of output 80 [2022-07-14 06:22:40,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:40,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 266 treesize of output 239 [2022-07-14 06:22:40,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 180 [2022-07-14 06:22:40,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 138 [2022-07-14 06:22:40,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2022-07-14 06:22:40,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:40,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-14 06:22:40,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:40,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-14 06:22:40,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:40,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:40,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:40,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2022-07-14 06:22:40,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:40,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:40,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-07-14 06:22:40,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:22:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:40,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:40,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740249915] [2022-07-14 06:22:40,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740249915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:40,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:40,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-14 06:22:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182437649] [2022-07-14 06:22:40,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:22:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:22:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=290, Unknown=4, NotChecked=148, Total=506 [2022-07-14 06:22:40,837 INFO L87 Difference]: Start difference. First operand 273 states and 332 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:44,030 INFO L93 Difference]: Finished difference Result 453 states and 539 transitions. [2022-07-14 06:22:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:22:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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 32 [2022-07-14 06:22:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:44,041 INFO L225 Difference]: With dead ends: 453 [2022-07-14 06:22:44,041 INFO L226 Difference]: Without dead ends: 453 [2022-07-14 06:22:44,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=774, Unknown=4, NotChecked=252, Total=1260 [2022-07-14 06:22:44,044 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 780 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1016 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:44,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 562 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 994 Invalid, 0 Unknown, 1016 Unchecked, 2.3s Time] [2022-07-14 06:22:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-07-14 06:22:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 339. [2022-07-14 06:22:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 338 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 421 transitions. [2022-07-14 06:22:44,050 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 421 transitions. Word has length 32 [2022-07-14 06:22:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:44,051 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 421 transitions. [2022-07-14 06:22:44,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 421 transitions. [2022-07-14 06:22:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:22:44,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:44,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:44,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:44,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:22:44,259 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:22:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1040904692, now seen corresponding path program 1 times [2022-07-14 06:22:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:44,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449591114] [2022-07-14 06:22:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:44,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:44,261 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:22:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:22:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:44,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:22:44,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:44,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:44,401 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 6 treesize of output 5 [2022-07-14 06:22:44,404 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 6 treesize of output 5 [2022-07-14 06:22:44,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:44,564 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 14 treesize of output 14 [2022-07-14 06:22:44,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:44,592 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 21 treesize of output 20 [2022-07-14 06:22:44,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:44,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:22:44,688 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:44,688 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 42 treesize of output 41 [2022-07-14 06:22:44,692 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 20 treesize of output 22 [2022-07-14 06:22:44,762 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:44,762 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 42 treesize of output 41 [2022-07-14 06:22:44,766 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 20 treesize of output 22 [2022-07-14 06:22:44,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:44,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2022-07-14 06:22:44,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:44,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:44,918 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:44,927 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_627) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:44,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_626) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_625))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_627)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:44,963 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_626) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_628))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_625))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_627))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:45,000 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc18#1.base|)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_625))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_627))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_622 (_ BitVec 32)) (v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 v_ArrVal_622)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_626) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base|)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_628)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:45,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_13| (_ BitVec 32))) (or (and (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc18#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_13| v_ArrVal_625))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_627))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_622 (_ BitVec 32)) (v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 v_ArrVal_622)) |v_ULTIMATE.start_main_#t~malloc18#1.base_13| v_ArrVal_626) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc18#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_13| v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_628)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_13|))))) is different from false [2022-07-14 06:22:46,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2022-07-14 06:22:46,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:46,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 122 [2022-07-14 06:22:46,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:46,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:46,079 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-14 06:22:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:46,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:46,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449591114] [2022-07-14 06:22:46,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449591114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:46,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:46,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2022-07-14 06:22:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099736793] [2022-07-14 06:22:46,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:46,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:22:46,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:46,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:22:46,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=348, Unknown=8, NotChecked=258, Total=702 [2022-07-14 06:22:46,090 INFO L87 Difference]: Start difference. First operand 339 states and 421 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:47,534 INFO L93 Difference]: Finished difference Result 375 states and 462 transitions. [2022-07-14 06:22:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:22:47,536 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 06:22:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:47,537 INFO L225 Difference]: With dead ends: 375 [2022-07-14 06:22:47,537 INFO L226 Difference]: Without dead ends: 375 [2022-07-14 06:22:47,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 15 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=247, Invalid=825, Unknown=8, NotChecked=402, Total=1482 [2022-07-14 06:22:47,538 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 125 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 930 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:47,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1183 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 455 Invalid, 0 Unknown, 930 Unchecked, 0.7s Time] [2022-07-14 06:22:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-14 06:22:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 354. [2022-07-14 06:22:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 312 states have (on average 1.4038461538461537) internal successors, (438), 353 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 438 transitions. [2022-07-14 06:22:47,552 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 438 transitions. Word has length 32 [2022-07-14 06:22:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:47,552 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 438 transitions. [2022-07-14 06:22:47,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 438 transitions. [2022-07-14 06:22:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:22:47,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:47,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:47,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:47,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:22:47,761 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:22:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash 892950918, now seen corresponding path program 1 times [2022-07-14 06:22:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:47,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466279832] [2022-07-14 06:22:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:47,763 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:22:47,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:22:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:47,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:22:47,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:47,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:47,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:22:47,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:22:48,038 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:48,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:22:48,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:48,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:22:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:48,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:22:48,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:48,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:22:48,179 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 20 treesize of output 22 [2022-07-14 06:22:48,245 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:48,246 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 38 treesize of output 37 [2022-07-14 06:22:48,257 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 20 treesize of output 22 [2022-07-14 06:22:48,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:48,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:48,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2022-07-14 06:22:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:48,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:48,482 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_675) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-14 06:22:48,492 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-07-14 06:22:48,521 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_672) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_673))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-14 06:22:48,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_672) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_673) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_673))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-14 06:22:48,577 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (_ BitVec 32)) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| v_ArrVal_669)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_672) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_673))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-14 06:22:48,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc13#1.base_10| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc13#1.base_10|))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_#t~malloc13#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc13#1.base_10| v_ArrVal_673))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (_ BitVec 32)) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset| v_ArrVal_669)) |v_ULTIMATE.start_main_#t~malloc13#1.base_10| v_ArrVal_672) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_#t~malloc13#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc13#1.base_10| v_ArrVal_673) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))))) is different from false [2022-07-14 06:22:48,949 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-14 06:22:48,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2022-07-14 06:22:48,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:48,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:48,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2022-07-14 06:22:48,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:48,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2022-07-14 06:22:48,970 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 114 treesize of output 96 [2022-07-14 06:22:48,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-07-14 06:22:48,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-14 06:22:48,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:22:49,009 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-14 06:22:49,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2022-07-14 06:22:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-14 06:22:49,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466279832] [2022-07-14 06:22:49,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466279832] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:49,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:49,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2022-07-14 06:22:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719406031] [2022-07-14 06:22:49,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:49,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:22:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:22:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=219, Unknown=9, NotChecked=210, Total=506 [2022-07-14 06:22:49,040 INFO L87 Difference]: Start difference. First operand 354 states and 438 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:50,479 INFO L93 Difference]: Finished difference Result 608 states and 759 transitions. [2022-07-14 06:22:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:22:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 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 32 [2022-07-14 06:22:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:50,481 INFO L225 Difference]: With dead ends: 608 [2022-07-14 06:22:50,481 INFO L226 Difference]: Without dead ends: 608 [2022-07-14 06:22:50,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=514, Unknown=9, NotChecked=330, Total=1056 [2022-07-14 06:22:50,482 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 243 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 968 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:50,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 916 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 774 Invalid, 0 Unknown, 968 Unchecked, 0.9s Time] [2022-07-14 06:22:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-14 06:22:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2022-07-14 06:22:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 331 states have (on average 1.392749244712991) internal successors, (461), 372 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 461 transitions. [2022-07-14 06:22:50,488 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 461 transitions. Word has length 32 [2022-07-14 06:22:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:50,489 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 461 transitions. [2022-07-14 06:22:50,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 461 transitions. [2022-07-14 06:22:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:22:50,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:50,490 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:50,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:50,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:22:50,698 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:22:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2089686132, now seen corresponding path program 1 times [2022-07-14 06:22:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:50,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324984330] [2022-07-14 06:22:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:50,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:50,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:50,700 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:22:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:22:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:50,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:22:50,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:50,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:50,856 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 6 treesize of output 5 [2022-07-14 06:22:50,869 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 6 treesize of output 5 [2022-07-14 06:22:51,026 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:51,026 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 14 treesize of output 14 [2022-07-14 06:22:51,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:51,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:22:51,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:51,068 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 21 treesize of output 20 [2022-07-14 06:22:51,154 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:51,154 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 42 treesize of output 41 [2022-07-14 06:22:51,158 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 20 treesize of output 22 [2022-07-14 06:22:51,222 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:51,223 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 42 treesize of output 41 [2022-07-14 06:22:51,226 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 20 treesize of output 22 [2022-07-14 06:22:51,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:51,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2022-07-14 06:22:51,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:51,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:51,445 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:51,454 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_733) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:51,483 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_732))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_733)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_731) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:51,504 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_731) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_734))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_732))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_733))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:51,557 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc18#1.base|)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_732))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_733))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 v_ArrVal_730)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_731) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base|)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_734)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2022-07-14 06:22:51,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_17| (_ BitVec 32))) (or (and (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_730)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_731) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_734)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_733))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_17|))))) is different from false [2022-07-14 06:22:54,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2022-07-14 06:22:54,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:54,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 122 [2022-07-14 06:22:54,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:54,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:54,605 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-14 06:22:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:54,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:54,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324984330] [2022-07-14 06:22:54,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324984330] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:54,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:54,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 28 [2022-07-14 06:22:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282197448] [2022-07-14 06:22:54,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:54,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:22:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:22:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=385, Unknown=11, NotChecked=270, Total=756 [2022-07-14 06:22:54,614 INFO L87 Difference]: Start difference. First operand 373 states and 461 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:54,861 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse1 (= .cse7 (_ bv0 32))) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse2 (= .cse6 (_ bv0 32)))) (and (= .cse0 (_ bv1 1)) (or (and .cse1 (not |c_ULTIMATE.start_main_#t~short7#1|) .cse2) (and (or (not .cse2) (not .cse1)) |c_ULTIMATE.start_main_#t~short7#1|)) .cse1 (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|) .cse2 (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_17| (_ BitVec 32))) (or (and (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3 v_ArrVal_730)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_731) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_734)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse5 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse5) v_ArrVal_733))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_17|))))) (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem5#1.offset| .cse6) (= .cse7 |c_ULTIMATE.start_main_#t~mem5#1.base|)))) is different from false [2022-07-14 06:22:55,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|))) (and (not (= (select .cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~root~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|)) (_ bv1 1))) (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_17| (_ BitVec 32))) (or (and (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_730)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_731) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_734)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_733))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_17|))))) (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|))) is different from false [2022-07-14 06:22:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:56,125 INFO L93 Difference]: Finished difference Result 414 states and 504 transitions. [2022-07-14 06:22:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:22:56,126 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 06:22:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:56,127 INFO L225 Difference]: With dead ends: 414 [2022-07-14 06:22:56,127 INFO L226 Difference]: Without dead ends: 414 [2022-07-14 06:22:56,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=300, Invalid=979, Unknown=13, NotChecked=600, Total=1892 [2022-07-14 06:22:56,128 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 865 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:56,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1064 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 689 Invalid, 0 Unknown, 865 Unchecked, 0.7s Time] [2022-07-14 06:22:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-14 06:22:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 374. [2022-07-14 06:22:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 332 states have (on average 1.391566265060241) internal successors, (462), 373 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 462 transitions. [2022-07-14 06:22:56,141 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 462 transitions. Word has length 34 [2022-07-14 06:22:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:56,141 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 462 transitions. [2022-07-14 06:22:56,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 462 transitions. [2022-07-14 06:22:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:22:56,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:56,142 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:56,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:56,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:22:56,354 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-14 06:22:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash 742188428, now seen corresponding path program 1 times [2022-07-14 06:22:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:56,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006627342] [2022-07-14 06:22:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:56,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:56,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:56,356 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:22:56,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 06:22:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:56,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:22:56,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:56,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:56,533 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:22:56,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 06:22:56,560 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 11 treesize of output 7 [2022-07-14 06:22:56,565 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 11 treesize of output 7 [2022-07-14 06:22:56,651 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:56,652 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 38 treesize of output 37 [2022-07-14 06:22:56,659 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 18 treesize of output 20 [2022-07-14 06:22:56,726 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:56,726 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 38 treesize of output 37 [2022-07-14 06:22:56,729 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 18 treesize of output 20 [2022-07-14 06:22:56,799 INFO L356 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2022-07-14 06:22:56,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 46 [2022-07-14 06:22:56,855 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 35 treesize of output 19 [2022-07-14 06:22:56,859 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-14 06:22:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:57,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:57,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (_ BitVec 1))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0) (_ bv1 1))) (and (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-14 06:22:57,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_791) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0) (_ bv1 1))) (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|))))) is different from false [2022-07-14 06:22:57,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1)) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_789))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_791)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0) (_ bv1 1))) (and (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_790) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2022-07-14 06:22:57,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1)) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_789))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_791)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0) (_ bv1 1))) (and (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|) (forall ((v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_790) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_789) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_792)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2022-07-14 06:22:57,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:57,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-14 06:22:57,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:57,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 120 treesize of output 123 [2022-07-14 06:22:57,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 104 [2022-07-14 06:22:57,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-14 06:22:57,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:57,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2022-07-14 06:22:57,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:57,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 306 treesize of output 273 [2022-07-14 06:22:57,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 250 [2022-07-14 06:22:57,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:57,758 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 250 treesize of output 238