./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-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-?-791161d [2022-07-23 05:57:43,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:57:43,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:57:43,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:57:43,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:57:43,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:57:43,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:57:43,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:57:43,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:57:43,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:57:43,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:57:43,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:57:43,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:57:43,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:57:43,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:57:43,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:57:43,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:57:43,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:57:43,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:57:43,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:57:43,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:57:43,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:57:43,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:57:43,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:57:43,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:57:43,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:57:43,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:57:43,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:57:43,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:57:43,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:57:43,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:57:43,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:57:43,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:57:43,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:57:43,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:57:43,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:57:43,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:57:43,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:57:43,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:57:43,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:57:43,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:57:43,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:57:43,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:57:43,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:57:43,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:57:43,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:57:43,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:57:43,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:57:43,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:57:43,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:57:43,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:57:43,267 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:57:43,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:57:43,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:57:43,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:57:43,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:57:43,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:57:43,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:57:43,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:57:43,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:57:43,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:57:43,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:57:43,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:57:43,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:57:43,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:57:43,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:57:43,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:57:43,272 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-23 05:57:43,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:57:43,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:57:43,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:57:43,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:57:43,472 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:57:43,473 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-23 05:57:43,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ee189c4/c9dcc905f2ba44d48e45836bed0cf297/FLAG4ae6a967d [2022-07-23 05:57:43,916 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:57:43,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-07-23 05:57:43,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ee189c4/c9dcc905f2ba44d48e45836bed0cf297/FLAG4ae6a967d [2022-07-23 05:57:43,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ee189c4/c9dcc905f2ba44d48e45836bed0cf297 [2022-07-23 05:57:43,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:57:43,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:57:43,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:57:43,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:57:43,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:57:43,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:57:43" (1/1) ... [2022-07-23 05:57:43,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cba6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:43, skipping insertion in model container [2022-07-23 05:57:43,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:57:43" (1/1) ... [2022-07-23 05:57:43,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:57:43,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:57:44,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:57:44,185 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-23 05:57:44,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12829689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:44, skipping insertion in model container [2022-07-23 05:57:44,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:57:44,186 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 05:57:44,188 INFO L158 Benchmark]: Toolchain (without parser) took 251.46ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 61.7MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 05:57:44,188 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 57.0MB in the beginning and 57.0MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 05:57:44,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.80ms. Allocated memory is still 88.1MB. Free memory was 52.4MB in the beginning and 61.7MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 05:57:44,190 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 57.0MB in the beginning and 57.0MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.80ms. Allocated memory is still 88.1MB. Free memory was 52.4MB in the beginning and 61.7MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. 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-?-791161d [2022-07-23 05:57:45,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:57:45,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:57:45,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:57:45,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:57:45,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:57:45,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:57:45,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:57:45,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:57:45,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:57:45,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:57:45,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:57:45,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:57:45,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:57:45,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:57:45,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:57:45,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:57:45,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:57:45,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:57:45,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:57:45,870 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:57:45,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:57:45,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:57:45,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:57:45,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:57:45,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:57:45,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:57:45,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:57:45,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:57:45,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:57:45,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:57:45,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:57:45,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:57:45,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:57:45,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:57:45,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:57:45,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:57:45,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:57:45,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:57:45,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:57:45,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:57:45,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:57:45,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 05:57:45,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:57:45,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:57:45,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:57:45,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:57:45,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:57:45,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:57:45,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:57:45,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:57:45,922 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:57:45,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:57:45,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:57:45,924 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:57:45,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:57:45,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:57:45,925 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 05:57:45,925 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 05:57:45,925 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:57:45,925 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:57:45,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:57:45,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:57:45,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:57:45,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:57:45,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:57:45,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:57:45,927 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 05:57:45,927 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 05:57:45,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 05:57:45,927 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-23 05:57:46,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:57:46,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:57:46,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:57:46,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:57:46,225 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:57:46,226 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-23 05:57:46,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e083fd1a5/489d155b96584c38aeb6c8c59043caa4/FLAGc73df6480 [2022-07-23 05:57:46,708 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:57:46,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-07-23 05:57:46,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e083fd1a5/489d155b96584c38aeb6c8c59043caa4/FLAGc73df6480 [2022-07-23 05:57:46,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e083fd1a5/489d155b96584c38aeb6c8c59043caa4 [2022-07-23 05:57:46,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:57:46,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:57:46,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:57:46,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:57:46,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:57:46,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:57:46" (1/1) ... [2022-07-23 05:57:46,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f560235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:46, skipping insertion in model container [2022-07-23 05:57:46,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:57:46" (1/1) ... [2022-07-23 05:57:46,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:57:46,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:57:47,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:57:47,093 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 05:57:47,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:57:47,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:57:47,140 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:57:47,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:57:47,191 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:57:47,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47 WrapperNode [2022-07-23 05:57:47,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:57:47,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:57:47,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:57:47,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:57:47,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,241 INFO L137 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-07-23 05:57:47,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:57:47,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:57:47,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:57:47,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:57:47,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:57:47,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:57:47,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:57:47,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:57:47,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (1/1) ... [2022-07-23 05:57:47,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:57:47,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:57:47,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 05:57:47,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 05:57:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:57:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:57:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:57:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:57:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:57:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:57:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 05:57:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:57:47,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:57:47,407 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:57:47,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:57:47,965 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:57:47,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:57:47,970 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 05:57:47,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:57:47 BoogieIcfgContainer [2022-07-23 05:57:47,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:57:47,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:57:47,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:57:47,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:57:47,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:57:46" (1/3) ... [2022-07-23 05:57:47,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9e12db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:57:47, skipping insertion in model container [2022-07-23 05:57:47,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:57:47" (2/3) ... [2022-07-23 05:57:47,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9e12db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:57:47, skipping insertion in model container [2022-07-23 05:57:47,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:57:47" (3/3) ... [2022-07-23 05:57:47,976 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2022-07-23 05:57:47,988 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:57:47,989 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-07-23 05:57:48,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:57:48,035 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@31dd5f19, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@386a01c6 [2022-07-23 05:57:48,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-07-23 05:57:48,038 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-23 05:57:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:57:48,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:48,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:57:48,044 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-23 05:57:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:48,049 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 05:57:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:48,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587253106] [2022-07-23 05:57:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:48,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:48,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:48,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 05:57:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:48,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:57:48,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:48,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:48,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:48,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:48,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587253106] [2022-07-23 05:57:48,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587253106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:48,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:48,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:57:48,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504934309] [2022-07-23 05:57:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:48,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:57:48,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:57:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:57:48,223 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-23 05:57:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:48,456 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-07-23 05:57:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:57:48,459 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-23 05:57:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:48,465 INFO L225 Difference]: With dead ends: 169 [2022-07-23 05:57:48,465 INFO L226 Difference]: Without dead ends: 167 [2022-07-23 05:57:48,467 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-23 05:57:48,470 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 05:57:48,471 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-23 05:57:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-23 05:57:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2022-07-23 05:57:48,516 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-23 05:57:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-23 05:57:48,520 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-23 05:57:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:48,520 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-23 05:57:48,520 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-23 05:57:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-23 05:57:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:57:48,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:48,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:57:48,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 05:57:48,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:48,728 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-23 05:57:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 05:57:48,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:48,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450805020] [2022-07-23 05:57:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:48,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:48,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 05:57:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:48,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:57:48,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:48,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:48,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:48,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:48,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450805020] [2022-07-23 05:57:48,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450805020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:48,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:57:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938157930] [2022-07-23 05:57:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:48,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:57:48,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:57:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:57:48,801 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-23 05:57:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:49,002 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-23 05:57:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:57:49,003 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-23 05:57:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:49,004 INFO L225 Difference]: With dead ends: 149 [2022-07-23 05:57:49,004 INFO L226 Difference]: Without dead ends: 149 [2022-07-23 05:57:49,004 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-23 05:57:49,005 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 05:57:49,005 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-23 05:57:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-23 05:57:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-07-23 05:57:49,010 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-23 05:57:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-07-23 05:57:49,011 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 3 [2022-07-23 05:57:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:49,011 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-07-23 05:57:49,012 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-23 05:57:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-07-23 05:57:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:57:49,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:49,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:57:49,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:49,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:49,218 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-23 05:57:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2022-07-23 05:57:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:49,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933800305] [2022-07-23 05:57:49,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:49,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:49,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:49,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:49,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 05:57:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:49,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:57:49,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:49,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:49,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:49,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933800305] [2022-07-23 05:57:49,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933800305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:49,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:49,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:57:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895441469] [2022-07-23 05:57:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:49,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:57:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:57:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:57:49,294 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-23 05:57:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:49,558 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2022-07-23 05:57:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:57:49,558 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-23 05:57:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:49,559 INFO L225 Difference]: With dead ends: 159 [2022-07-23 05:57:49,559 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 05:57:49,559 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-23 05:57:49,560 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:57:49,560 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.2s Time] [2022-07-23 05:57:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 05:57:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2022-07-23 05:57:49,565 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-23 05:57:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-07-23 05:57:49,565 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 6 [2022-07-23 05:57:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:49,565 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-07-23 05:57:49,565 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-23 05:57:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-07-23 05:57:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:57:49,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:49,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:57:49,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:49,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:49,772 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-23 05:57:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2022-07-23 05:57:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:49,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545519371] [2022-07-23 05:57:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:49,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:49,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:49,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 05:57:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:49,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:57:49,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:49,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:49,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:49,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:49,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545519371] [2022-07-23 05:57:49,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545519371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:49,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:49,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:57:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966592209] [2022-07-23 05:57:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:49,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:57:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:49,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:57:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:57:49,869 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-23 05:57:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:50,205 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-07-23 05:57:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:57:50,205 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-23 05:57:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:50,207 INFO L225 Difference]: With dead ends: 185 [2022-07-23 05:57:50,207 INFO L226 Difference]: Without dead ends: 185 [2022-07-23 05:57:50,207 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-23 05:57:50,208 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-23 05:57:50,208 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-23 05:57:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-23 05:57:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2022-07-23 05:57:50,234 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-23 05:57:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2022-07-23 05:57:50,235 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 6 [2022-07-23 05:57:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:50,235 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2022-07-23 05:57:50,235 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-23 05:57:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2022-07-23 05:57:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 05:57:50,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:50,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:50,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:50,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:50,443 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-23 05:57:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826674, now seen corresponding path program 1 times [2022-07-23 05:57:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:50,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498172393] [2022-07-23 05:57:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:50,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:50,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:50,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:50,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 05:57:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:50,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 05:57:50,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:50,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:50,526 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:57:50,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:57:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:50,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:50,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498172393] [2022-07-23 05:57:50,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498172393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:50,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:57:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825877422] [2022-07-23 05:57:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:57:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:57:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:57:50,534 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-23 05:57:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:50,861 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-07-23 05:57:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:57:50,861 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-23 05:57:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:50,862 INFO L225 Difference]: With dead ends: 182 [2022-07-23 05:57:50,862 INFO L226 Difference]: Without dead ends: 182 [2022-07-23 05:57:50,862 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-23 05:57:50,863 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 112 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:57:50,863 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.3s Time] [2022-07-23 05:57:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-23 05:57:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-07-23 05:57:50,866 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-23 05:57:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2022-07-23 05:57:50,866 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 9 [2022-07-23 05:57:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:50,866 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2022-07-23 05:57:50,866 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-23 05:57:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2022-07-23 05:57:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:57:50,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:50,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:50,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:51,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:51,074 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-23 05:57:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2022-07-23 05:57:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:51,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711208817] [2022-07-23 05:57:51,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:51,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:51,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:51,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:51,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 05:57:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 05:57:51,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:51,145 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-23 05:57:51,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:51,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:51,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711208817] [2022-07-23 05:57:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711208817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:51,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:51,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:57:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793707816] [2022-07-23 05:57:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:57:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:57:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:57:51,148 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-23 05:57:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:51,157 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2022-07-23 05:57:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:57:51,158 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-23 05:57:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:51,159 INFO L225 Difference]: With dead ends: 167 [2022-07-23 05:57:51,159 INFO L226 Difference]: Without dead ends: 167 [2022-07-23 05:57:51,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:57:51,160 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-23 05:57:51,160 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-23 05:57:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-23 05:57:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-23 05:57:51,163 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-23 05:57:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-07-23 05:57:51,164 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 13 [2022-07-23 05:57:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:51,165 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-07-23 05:57:51,165 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-23 05:57:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-07-23 05:57:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:57:51,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:51,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:51,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-23 05:57:51,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:51,375 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-23 05:57:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 131239230, now seen corresponding path program 1 times [2022-07-23 05:57:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074704669] [2022-07-23 05:57:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:51,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:51,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:51,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:51,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 05:57:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:51,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:57:51,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:51,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:51,510 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-23 05:57:51,532 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-23 05:57:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:51,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:51,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074704669] [2022-07-23 05:57:51,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074704669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:51,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:51,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:57:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128514986] [2022-07-23 05:57:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:51,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:57:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:57:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:57:51,542 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-23 05:57:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:51,878 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2022-07-23 05:57:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:57:51,879 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-23 05:57:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:51,880 INFO L225 Difference]: With dead ends: 166 [2022-07-23 05:57:51,880 INFO L226 Difference]: Without dead ends: 166 [2022-07-23 05:57:51,881 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-23 05:57:51,881 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-23 05:57:51,881 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-23 05:57:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-23 05:57:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-23 05:57:51,884 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-23 05:57:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2022-07-23 05:57:51,885 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 15 [2022-07-23 05:57:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:51,885 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2022-07-23 05:57:51,885 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-23 05:57:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2022-07-23 05:57:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:57:51,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:51,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:51,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:52,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:52,087 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-23 05:57:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 131239231, now seen corresponding path program 1 times [2022-07-23 05:57:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:52,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607120898] [2022-07-23 05:57:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:52,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:52,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:52,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 05:57:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:52,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:57:52,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:52,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:52,190 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-23 05:57:52,196 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-23 05:57:52,228 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-23 05:57:52,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:57:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:52,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:52,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607120898] [2022-07-23 05:57:52,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607120898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:52,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:52,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:57:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897775462] [2022-07-23 05:57:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:52,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:57:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:52,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:57:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:57:52,249 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-23 05:57:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:52,549 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-07-23 05:57:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:57:52,550 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-23 05:57:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:52,551 INFO L225 Difference]: With dead ends: 165 [2022-07-23 05:57:52,551 INFO L226 Difference]: Without dead ends: 165 [2022-07-23 05:57:52,551 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-23 05:57:52,552 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 4 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 05:57:52,552 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-23 05:57:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-23 05:57:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-23 05:57:52,557 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-23 05:57:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2022-07-23 05:57:52,559 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 15 [2022-07-23 05:57:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:52,560 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2022-07-23 05:57:52,560 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-23 05:57:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2022-07-23 05:57:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:57:52,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:52,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:52,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:52,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:52,772 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-23 05:57:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2022-07-23 05:57:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:52,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279968008] [2022-07-23 05:57:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:52,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:52,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 05:57:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:52,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:57:52,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:52,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:57:52,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:57:52,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:57:52,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:57:52,913 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-23 05:57:52,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:52,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:52,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279968008] [2022-07-23 05:57:52,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279968008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:52,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:52,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:57:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145540948] [2022-07-23 05:57:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:52,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:57:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:57:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:57:52,914 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-23 05:57:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:53,308 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2022-07-23 05:57:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:57:53,308 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-23 05:57:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:53,309 INFO L225 Difference]: With dead ends: 203 [2022-07-23 05:57:53,309 INFO L226 Difference]: Without dead ends: 203 [2022-07-23 05:57:53,309 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-23 05:57:53,310 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-23 05:57:53,310 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-23 05:57:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-23 05:57:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2022-07-23 05:57:53,313 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-23 05:57:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2022-07-23 05:57:53,313 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 15 [2022-07-23 05:57:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:53,313 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2022-07-23 05:57:53,313 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-23 05:57:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2022-07-23 05:57:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:57:53,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:53,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:53,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:53,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:53,521 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-23 05:57:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751881, now seen corresponding path program 1 times [2022-07-23 05:57:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:53,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234775017] [2022-07-23 05:57:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:53,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:53,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:53,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:53,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 05:57:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:53,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:57:53,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:53,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:53,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:57:53,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 05:57:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:53,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:53,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:53,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234775017] [2022-07-23 05:57:53,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234775017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:53,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:53,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:57:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186140450] [2022-07-23 05:57:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:53,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:57:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:53,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:57:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:57:53,648 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-23 05:57:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:53,941 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-07-23 05:57:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:57:53,942 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-23 05:57:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:53,943 INFO L225 Difference]: With dead ends: 175 [2022-07-23 05:57:53,943 INFO L226 Difference]: Without dead ends: 175 [2022-07-23 05:57:53,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:57:53,943 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-23 05:57:53,943 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-23 05:57:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-23 05:57:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-23 05:57:53,946 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-23 05:57:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2022-07-23 05:57:53,946 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 17 [2022-07-23 05:57:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:53,946 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2022-07-23 05:57:53,946 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-23 05:57:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2022-07-23 05:57:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:57:53,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:53,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:53,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:54,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:54,160 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-23 05:57:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751880, now seen corresponding path program 1 times [2022-07-23 05:57:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:54,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517721003] [2022-07-23 05:57:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:54,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:54,162 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:54,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 05:57:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:54,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:57:54,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:54,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:54,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:57:54,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:57:54,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 05:57:54,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:57:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:54,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:54,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:54,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517721003] [2022-07-23 05:57:54,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517721003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:54,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:54,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:57:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899753550] [2022-07-23 05:57:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:54,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:57:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:57:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:57:54,308 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-23 05:57:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:54,684 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2022-07-23 05:57:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:57:54,685 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-23 05:57:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:54,686 INFO L225 Difference]: With dead ends: 174 [2022-07-23 05:57:54,686 INFO L226 Difference]: Without dead ends: 174 [2022-07-23 05:57:54,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:57:54,686 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-23 05:57:54,686 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-23 05:57:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-23 05:57:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-07-23 05:57:54,689 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-23 05:57:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2022-07-23 05:57:54,689 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 17 [2022-07-23 05:57:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:54,689 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2022-07-23 05:57:54,690 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-23 05:57:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2022-07-23 05:57:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:57:54,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:54,690 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:54,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:54,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:54,891 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-23 05:57:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:54,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1696190880, now seen corresponding path program 1 times [2022-07-23 05:57:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:54,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313788094] [2022-07-23 05:57:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:54,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:54,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:54,893 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:54,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 05:57:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:54,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 05:57:54,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:54,990 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-23 05:57:54,994 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-23 05:57:55,035 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 05:57:55,035 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-23 05:57:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:57:55,041 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-23 05:57:55,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:57:55,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:57:55,112 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-23 05:57:55,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:55,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:55,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313788094] [2022-07-23 05:57:55,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313788094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:55,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:55,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:57:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911236142] [2022-07-23 05:57:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:55,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:57:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:57:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:57:55,115 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-23 05:57:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:55,464 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2022-07-23 05:57:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:57:55,464 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-23 05:57:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:55,465 INFO L225 Difference]: With dead ends: 287 [2022-07-23 05:57:55,465 INFO L226 Difference]: Without dead ends: 287 [2022-07-23 05:57:55,465 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-23 05:57:55,466 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 158 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 05:57:55,466 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-23 05:57:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-23 05:57:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 184. [2022-07-23 05:57:55,468 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-23 05:57:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-23 05:57:55,469 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 17 [2022-07-23 05:57:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:55,469 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-23 05:57:55,469 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-23 05:57:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-23 05:57:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:57:55,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:55,469 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:55,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:55,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:55,677 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-23 05:57:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188958, now seen corresponding path program 1 times [2022-07-23 05:57:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:55,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860845314] [2022-07-23 05:57:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:55,680 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:55,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 05:57:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:55,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:57:55,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:55,758 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-23 05:57:55,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:55,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860845314] [2022-07-23 05:57:55,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860845314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:55,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:57:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114140481] [2022-07-23 05:57:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:57:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:57:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:57:55,760 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-23 05:57:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:56,025 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-07-23 05:57:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:57:56,026 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-23 05:57:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:56,027 INFO L225 Difference]: With dead ends: 225 [2022-07-23 05:57:56,027 INFO L226 Difference]: Without dead ends: 225 [2022-07-23 05:57:56,027 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-23 05:57:56,027 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-23 05:57:56,028 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-23 05:57:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-23 05:57:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2022-07-23 05:57:56,030 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-23 05:57:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2022-07-23 05:57:56,031 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 17 [2022-07-23 05:57:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:56,031 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2022-07-23 05:57:56,031 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-23 05:57:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2022-07-23 05:57:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:57:56,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:56,031 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:57:56,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:56,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:56,239 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-23 05:57:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188959, now seen corresponding path program 1 times [2022-07-23 05:57:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185209873] [2022-07-23 05:57:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:56,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:56,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:56,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:56,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 05:57:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:56,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 05:57:56,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:56,381 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-23 05:57:56,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:56,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:56,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185209873] [2022-07-23 05:57:56,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185209873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:56,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:56,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:57:56,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814519364] [2022-07-23 05:57:56,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:56,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:57:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:56,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:57:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:57:56,382 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-23 05:57:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:56,922 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2022-07-23 05:57:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:57:56,923 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-23 05:57:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:56,924 INFO L225 Difference]: With dead ends: 302 [2022-07-23 05:57:56,924 INFO L226 Difference]: Without dead ends: 302 [2022-07-23 05:57:56,924 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-23 05:57:56,924 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-23 05:57:56,925 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-23 05:57:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-23 05:57:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 189. [2022-07-23 05:57:56,927 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-23 05:57:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2022-07-23 05:57:56,927 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 17 [2022-07-23 05:57:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:56,928 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2022-07-23 05:57:56,928 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-23 05:57:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2022-07-23 05:57:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:57:56,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:56,928 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-23 05:57:56,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:57,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:57,135 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-23 05:57:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705298, now seen corresponding path program 1 times [2022-07-23 05:57:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:57,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60237517] [2022-07-23 05:57:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:57,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:57,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:57,138 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:57,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 05:57:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:57,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 05:57:57,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:57,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:57,253 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:57:57,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:57:57,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:57:57,282 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-23 05:57:57,288 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-23 05:57:57,338 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:57:57,338 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-23 05:57:57,342 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-23 05:57:57,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 05:57:57,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:57:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:57,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:57,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:57,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60237517] [2022-07-23 05:57:57,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60237517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:57,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:57,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:57:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705557467] [2022-07-23 05:57:57,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:57,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:57:57,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:57:57,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:57:57,378 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-23 05:57:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:57,931 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2022-07-23 05:57:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:57:57,932 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-23 05:57:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:57,933 INFO L225 Difference]: With dead ends: 207 [2022-07-23 05:57:57,933 INFO L226 Difference]: Without dead ends: 207 [2022-07-23 05:57:57,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:57:57,933 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-23 05:57:57,934 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-23 05:57:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-23 05:57:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2022-07-23 05:57:57,936 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-23 05:57:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2022-07-23 05:57:57,937 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 18 [2022-07-23 05:57:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:57,937 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2022-07-23 05:57:57,937 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-23 05:57:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2022-07-23 05:57:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:57:57,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:57,937 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-23 05:57:57,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:58,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:58,144 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-23 05:57:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705297, now seen corresponding path program 1 times [2022-07-23 05:57:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:58,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618423525] [2022-07-23 05:57:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:58,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:58,148 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 05:57:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:58,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 05:57:58,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:58,257 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 05:57:58,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-23 05:57:58,379 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 05:57:58,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-23 05:57:58,478 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-23 05:57:58,596 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:57:58,596 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 47 treesize of output 46 [2022-07-23 05:57:58,638 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 44 treesize of output 28 [2022-07-23 05:57:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:58,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:57:58,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:58,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618423525] [2022-07-23 05:57:58,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618423525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:57:58,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:57:58,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:57:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582809309] [2022-07-23 05:57:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:57:58,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:57:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:57:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:57:58,699 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-23 05:57:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:57:59,368 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2022-07-23 05:57:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:57:59,369 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-23 05:57:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:57:59,369 INFO L225 Difference]: With dead ends: 206 [2022-07-23 05:57:59,370 INFO L226 Difference]: Without dead ends: 206 [2022-07-23 05:57:59,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:57:59,370 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 312 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:57:59,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 220 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 339 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2022-07-23 05:57:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-23 05:57:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2022-07-23 05:57:59,372 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-23 05:57:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-07-23 05:57:59,373 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 18 [2022-07-23 05:57:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:57:59,373 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-07-23 05:57:59,373 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-23 05:57:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-07-23 05:57:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:57:59,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:57:59,374 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-23 05:57:59,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-23 05:57:59,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:57:59,581 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-23 05:57:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:57:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1042249152, now seen corresponding path program 1 times [2022-07-23 05:57:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:57:59,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93860815] [2022-07-23 05:57:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:57:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:57:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:57:59,595 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:57:59,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 05:57:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:57:59,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:57:59,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:57:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:59,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:57:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:57:59,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:57:59,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93860815] [2022-07-23 05:57:59,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93860815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:57:59,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:57:59,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-23 05:57:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770972476] [2022-07-23 05:57:59,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:57:59,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:57:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:57:59,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:57:59,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:57:59,751 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-23 05:58:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:00,057 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2022-07-23 05:58:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:58:00,058 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-23 05:58:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:00,059 INFO L225 Difference]: With dead ends: 264 [2022-07-23 05:58:00,059 INFO L226 Difference]: Without dead ends: 264 [2022-07-23 05:58:00,059 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-23 05:58:00,059 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:00,060 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.3s Time] [2022-07-23 05:58:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-23 05:58:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 186. [2022-07-23 05:58:00,062 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-23 05:58:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-23 05:58:00,062 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 18 [2022-07-23 05:58:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:00,063 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-23 05:58:00,063 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-23 05:58:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-23 05:58:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 05:58:00,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:00,063 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-23 05:58:00,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 05:58:00,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:58:00,271 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-23 05:58:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350413, now seen corresponding path program 1 times [2022-07-23 05:58:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:00,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830293323] [2022-07-23 05:58:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:00,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:00,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:00,273 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:58:00,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 05:58:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:00,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 05:58:00,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:00,373 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 05:58:00,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-23 05:58:00,431 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 05:58:00,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-23 05:58:00,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:00,605 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:00,606 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 54 treesize of output 53 [2022-07-23 05:58:00,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2022-07-23 05:58:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:00,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:00,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830293323] [2022-07-23 05:58:00,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830293323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:00,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:00,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:58:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832322508] [2022-07-23 05:58:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:00,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:58:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:00,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:58:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:58:00,719 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-23 05:58:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:01,457 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2022-07-23 05:58:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:58:01,458 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-23 05:58:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:01,458 INFO L225 Difference]: With dead ends: 205 [2022-07-23 05:58:01,458 INFO L226 Difference]: Without dead ends: 205 [2022-07-23 05:58:01,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:58:01,459 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 309 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:01,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 217 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 339 Invalid, 0 Unknown, 92 Unchecked, 0.5s Time] [2022-07-23 05:58:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-23 05:58:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-07-23 05:58:01,462 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-23 05:58:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-07-23 05:58:01,463 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 20 [2022-07-23 05:58:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:01,463 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-07-23 05:58:01,463 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-23 05:58:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-07-23 05:58:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 05:58:01,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:01,466 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-23 05:58:01,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-23 05:58:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:58:01,673 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-23 05:58:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350412, now seen corresponding path program 1 times [2022-07-23 05:58:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:01,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235555235] [2022-07-23 05:58:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:01,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:01,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:01,675 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:58:01,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 05:58:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 05:58:01,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:01,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:01,828 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:01,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:58:01,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:01,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:01,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:01,924 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:01,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 05:58:01,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 05:58:01,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:58:01,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:01,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:01,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:01,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235555235] [2022-07-23 05:58:01,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235555235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:01,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:01,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:58:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108367593] [2022-07-23 05:58:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:01,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:58:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:01,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:58:01,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:58:01,967 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-23 05:58:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:02,642 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2022-07-23 05:58:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:58:02,643 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-23 05:58:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:02,643 INFO L225 Difference]: With dead ends: 204 [2022-07-23 05:58:02,643 INFO L226 Difference]: Without dead ends: 204 [2022-07-23 05:58:02,644 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-23 05:58:02,644 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-23 05:58:02,644 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-23 05:58:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-23 05:58:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2022-07-23 05:58:02,646 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-23 05:58:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-23 05:58:02,647 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 20 [2022-07-23 05:58:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:02,647 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-23 05:58:02,647 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-23 05:58:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-23 05:58:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:58:02,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:02,647 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:02,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 05:58:02,848 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-23 05:58:02,848 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-23 05:58:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1776483090, now seen corresponding path program 1 times [2022-07-23 05:58:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:02,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678010196] [2022-07-23 05:58:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:02,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:02,850 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-23 05:58:02,856 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-23 05:58:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:03,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:58:03,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:03,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:03,081 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-23 05:58:03,081 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-23 05:58:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:03,090 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-23 05:58:03,129 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-23 05:58:03,129 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-23 05:58:03,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:03,134 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-23 05:58:03,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:58:03,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:58:03,219 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-23 05:58:03,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:03,297 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-23 05:58:03,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678010196] [2022-07-23 05:58:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678010196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:03,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-23 05:58:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191157659] [2022-07-23 05:58:03,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:03,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:58:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:58:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:58:03,299 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-23 05:58:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:04,009 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2022-07-23 05:58:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 05:58:04,011 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-23 05:58:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:04,011 INFO L225 Difference]: With dead ends: 224 [2022-07-23 05:58:04,012 INFO L226 Difference]: Without dead ends: 224 [2022-07-23 05:58:04,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-23 05:58:04,012 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-23 05:58:04,013 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-23 05:58:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-23 05:58:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 193. [2022-07-23 05:58:04,015 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-23 05:58:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2022-07-23 05:58:04,015 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 26 [2022-07-23 05:58:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:04,015 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2022-07-23 05:58:04,016 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-23 05:58:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2022-07-23 05:58:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:58:04,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:04,016 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-23 05:58:04,038 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-23 05:58:04,223 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-23 05:58:04,224 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-23 05:58:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719994, now seen corresponding path program 1 times [2022-07-23 05:58:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:04,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873680790] [2022-07-23 05:58:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:04,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:04,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:04,240 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:58:04,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 05:58:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:04,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 05:58:04,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:04,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:04,440 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:58:04,440 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-23 05:58:04,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:04,540 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:04,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-23 05:58:04,599 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:04,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-23 05:58:06,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:06,789 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-23 05:58:06,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:08,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (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_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-23 05:58:08,904 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-23 05:58:08,914 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-23 05:58:08,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:08,925 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-23 05:58:08,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:08,936 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-23 05:58:08,942 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-23 05:58:08,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:08,954 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-23 05:58:23,784 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-23 05:58:23,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873680790] [2022-07-23 05:58:23,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873680790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:23,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:23,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-23 05:58:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092949100] [2022-07-23 05:58:23,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:23,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:58:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:23,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:58:23,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=295, Unknown=9, NotChecked=114, Total=506 [2022-07-23 05:58:23,785 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-23 05:58:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:41,888 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2022-07-23 05:58:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:58:41,889 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-23 05:58:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:41,889 INFO L225 Difference]: With dead ends: 326 [2022-07-23 05:58:41,889 INFO L226 Difference]: Without dead ends: 326 [2022-07-23 05:58:41,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=235, Invalid=572, Unknown=17, NotChecked=168, Total=992 [2022-07-23 05:58:41,890 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 306 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1215 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:41,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 860 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 991 Invalid, 0 Unknown, 1215 Unchecked, 1.6s Time] [2022-07-23 05:58:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-23 05:58:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 273. [2022-07-23 05:58:41,894 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-23 05:58:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 332 transitions. [2022-07-23 05:58:41,894 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 332 transitions. Word has length 32 [2022-07-23 05:58:41,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:41,894 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 332 transitions. [2022-07-23 05:58:41,895 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-23 05:58:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 332 transitions. [2022-07-23 05:58:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:58:41,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:41,895 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-23 05:58:41,903 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-23 05:58:42,096 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-23 05:58:42,096 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-23 05:58:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719993, now seen corresponding path program 1 times [2022-07-23 05:58:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:42,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111897528] [2022-07-23 05:58:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:42,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:42,098 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-23 05:58:42,100 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-23 05:58:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:42,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:58:42,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:42,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:42,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:42,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:58:42,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:42,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:42,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:42,416 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:42,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 05:58:42,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 05:58:42,484 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:42,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 05:58:42,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 05:58:42,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:58:42,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 05:58:42,627 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-23 05:58:42,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:42,901 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-23 05:58:42,924 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-23 05:58:42,962 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-23 05:58:43,125 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-23 05:58:43,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:43,187 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-23 05:58:43,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:43,199 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-23 05:58:43,204 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-23 05:58:43,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:43,243 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-23 05:58:43,266 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-23 05:58:43,281 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-23 05:58:43,290 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-23 05:58:43,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:43,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-23 05:58:43,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:43,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-23 05:58:43,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:43,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:43,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:43,452 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-23 05:58:43,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:43,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:43,458 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-23 05:58:43,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 05:58:43,786 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-23 05:58:43,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111897528] [2022-07-23 05:58:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111897528] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:43,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-23 05:58:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574298745] [2022-07-23 05:58:43,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:58:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:58:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=290, Unknown=4, NotChecked=148, Total=506 [2022-07-23 05:58:43,787 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-23 05:58:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:47,129 INFO L93 Difference]: Finished difference Result 453 states and 539 transitions. [2022-07-23 05:58:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:58:47,130 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-23 05:58:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:47,131 INFO L225 Difference]: With dead ends: 453 [2022-07-23 05:58:47,131 INFO L226 Difference]: Without dead ends: 453 [2022-07-23 05:58:47,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=230, Invalid=774, Unknown=4, NotChecked=252, Total=1260 [2022-07-23 05:58:47,132 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 691 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 992 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:47,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 806 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1265 Invalid, 0 Unknown, 992 Unchecked, 2.4s Time] [2022-07-23 05:58:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-07-23 05:58:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 339. [2022-07-23 05:58:47,143 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-23 05:58:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 421 transitions. [2022-07-23 05:58:47,144 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 421 transitions. Word has length 32 [2022-07-23 05:58:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:47,144 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 421 transitions. [2022-07-23 05:58:47,144 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-23 05:58:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 421 transitions. [2022-07-23 05:58:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:58:47,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:47,146 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-23 05:58:47,155 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-23 05:58:47,353 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-23 05:58:47,353 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-23 05:58:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1040904692, now seen corresponding path program 1 times [2022-07-23 05:58:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:47,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664279532] [2022-07-23 05:58:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:47,355 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-23 05:58:47,356 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-23 05:58:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:47,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:58:47,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:47,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:47,517 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-23 05:58:47,714 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:47,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:58:47,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:47,755 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-23 05:58:47,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:47,763 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-23 05:58:47,889 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:47,889 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-23 05:58:47,893 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-23 05:58:47,963 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:47,963 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-23 05:58:47,967 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-23 05:58:48,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:48,039 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-23 05:58:48,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:58:48,078 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-23 05:58:48,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:48,135 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-23 05:58:48,145 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-23 05:58:48,165 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-23 05:58:48,182 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-23 05:58:48,238 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-23 05:58:53,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:53,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:53,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2022-07-23 05:58:53,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:53,792 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 106 treesize of output 88 [2022-07-23 05:58:53,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:53,796 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 104 treesize of output 72 [2022-07-23 05:58:53,803 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 9 treesize of output 7 [2022-07-23 05:58:53,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:53,815 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-23 05:58:53,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2022-07-23 05:58:53,822 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-23 05:58:53,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:53,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664279532] [2022-07-23 05:58:53,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664279532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:53,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:53,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2022-07-23 05:58:53,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276386263] [2022-07-23 05:58:53,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:53,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 05:58:53,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:53,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 05:58:53,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=377, Unknown=15, NotChecked=220, Total=702 [2022-07-23 05:58:53,825 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-23 05:58:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:55,433 INFO L93 Difference]: Finished difference Result 577 states and 708 transitions. [2022-07-23 05:58:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:58:55,433 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-23 05:58:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:55,435 INFO L225 Difference]: With dead ends: 577 [2022-07-23 05:58:55,435 INFO L226 Difference]: Without dead ends: 577 [2022-07-23 05:58:55,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=277, Invalid=850, Unknown=15, NotChecked=340, Total=1482 [2022-07-23 05:58:55,436 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 262 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1134 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:55,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 982 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 872 Invalid, 0 Unknown, 1134 Unchecked, 1.0s Time] [2022-07-23 05:58:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-07-23 05:58:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 453. [2022-07-23 05:58:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 411 states have (on average 1.3941605839416058) internal successors, (573), 452 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 573 transitions. [2022-07-23 05:58:55,445 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 573 transitions. Word has length 32 [2022-07-23 05:58:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:55,445 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 573 transitions. [2022-07-23 05:58:55,445 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-23 05:58:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 573 transitions. [2022-07-23 05:58:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:58:55,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:55,446 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-23 05:58:55,455 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-23 05:58:55,646 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-23 05:58:55,647 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-23 05:58:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 892950918, now seen corresponding path program 1 times [2022-07-23 05:58:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:55,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186944274] [2022-07-23 05:58:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:55,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:55,660 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-23 05:58:55,675 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-23 05:58:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:55,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 05:58:55,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:55,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:55,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:55,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:58:55,984 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:55,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:58:56,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:56,037 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-23 05:58:56,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:56,045 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-23 05:58:56,163 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:56,163 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-23 05:58:56,167 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-23 05:58:56,249 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:56,250 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-23 05:58:56,258 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-23 05:58:56,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:58:56,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:56,352 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-23 05:58:56,381 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-23 05:58:56,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:56,464 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-23 05:58:56,480 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-23 05:58:56,506 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-23 05:58:56,527 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-23 05:58:56,556 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-23 05:58:56,912 WARN L833 $PredicateComparison]: unable to prove that (and (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|))) (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_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|))) (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-23 05:58:56,957 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-23 05:58:56,957 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 41 [2022-07-23 05:58:56,963 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 05:58:56,963 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 242 treesize of output 164 [2022-07-23 05:58:56,969 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 05:58:56,969 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 133 treesize of output 113 [2022-07-23 05:58:56,971 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 113 treesize of output 97 [2022-07-23 05:58:56,991 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-23 05:58:56,991 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 1 [2022-07-23 05:58:57,033 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-23 05:58:57,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:57,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186944274] [2022-07-23 05:58:57,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186944274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:57,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:57,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2022-07-23 05:58:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933482963] [2022-07-23 05:58:57,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:57,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:58:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:57,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:58:57,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=219, Unknown=9, NotChecked=210, Total=506 [2022-07-23 05:58:57,036 INFO L87 Difference]: Start difference. First operand 453 states and 573 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-23 05:58:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:58,451 INFO L93 Difference]: Finished difference Result 734 states and 927 transitions. [2022-07-23 05:58:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:58:58,451 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-23 05:58:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:58,458 INFO L225 Difference]: With dead ends: 734 [2022-07-23 05:58:58,458 INFO L226 Difference]: Without dead ends: 734 [2022-07-23 05:58:58,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=514, Unknown=9, NotChecked=330, Total=1056 [2022-07-23 05:58:58,459 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 275 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1041 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:58,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 958 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 727 Invalid, 0 Unknown, 1041 Unchecked, 0.9s Time] [2022-07-23 05:58:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-07-23 05:58:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 481. [2022-07-23 05:58:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 439 states have (on average 1.3849658314350797) internal successors, (608), 480 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 608 transitions. [2022-07-23 05:58:58,466 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 608 transitions. Word has length 32 [2022-07-23 05:58:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:58,466 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 608 transitions. [2022-07-23 05:58:58,466 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-23 05:58:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 608 transitions. [2022-07-23 05:58:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:58:58,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:58,467 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-23 05:58:58,481 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-23 05:58:58,674 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-23 05:58:58,674 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-23 05:58:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2089686132, now seen corresponding path program 1 times [2022-07-23 05:58:58,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:58,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665482651] [2022-07-23 05:58:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:58,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:58,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:58,677 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-23 05:58:58,679 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-23 05:58:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:58,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:58:58,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:58,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:58:58,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-23 05:58:58,872 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-23 05:58:59,084 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:59,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:58:59,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:59,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:58:59,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:59,130 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-23 05:58:59,246 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:59,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 42 treesize of output 41 [2022-07-23 05:58:59,250 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-23 05:58:59,354 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:59,355 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-23 05:58:59,359 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-23 05:58:59,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:59,428 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-23 05:58:59,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:58:59,485 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-23 05:58:59,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:59,570 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-23 05:58:59,584 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-23 05:58:59,607 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-23 05:58:59,624 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-23 05:58:59,659 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-23 05:59:07,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:07,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:07,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2022-07-23 05:59:07,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:07,374 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 230 treesize of output 164 [2022-07-23 05:59:07,379 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 133 treesize of output 125 [2022-07-23 05:59:07,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:07,388 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 125 treesize of output 97 [2022-07-23 05:59:07,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:07,431 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-23 05:59:07,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2022-07-23 05:59:07,435 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-23 05:59:07,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:07,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665482651] [2022-07-23 05:59:07,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665482651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:59:07,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:59:07,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 28 [2022-07-23 05:59:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194450284] [2022-07-23 05:59:07,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:59:07,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-23 05:59:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-23 05:59:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=418, Unknown=16, NotChecked=230, Total=756 [2022-07-23 05:59:07,436 INFO L87 Difference]: Start difference. First operand 481 states and 608 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-23 05:59:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:08,724 INFO L93 Difference]: Finished difference Result 561 states and 696 transitions. [2022-07-23 05:59:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:59:08,725 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-23 05:59:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:08,727 INFO L225 Difference]: With dead ends: 561 [2022-07-23 05:59:08,727 INFO L226 Difference]: Without dead ends: 561 [2022-07-23 05:59:08,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=197, Invalid=929, Unknown=16, NotChecked=340, Total=1482 [2022-07-23 05:59:08,728 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 195 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 732 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:08,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1078 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 443 Invalid, 0 Unknown, 732 Unchecked, 0.7s Time] [2022-07-23 05:59:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-07-23 05:59:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 516. [2022-07-23 05:59:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 474 states have (on average 1.369198312236287) internal successors, (649), 515 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 649 transitions. [2022-07-23 05:59:08,745 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 649 transitions. Word has length 34 [2022-07-23 05:59:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:08,745 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 649 transitions. [2022-07-23 05:59:08,746 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-23 05:59:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 649 transitions. [2022-07-23 05:59:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:59:08,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:08,747 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-23 05:59:08,758 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-23 05:59:08,950 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-23 05:59:08,951 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-23 05:59:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 742188428, now seen corresponding path program 1 times [2022-07-23 05:59:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:08,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478271356] [2022-07-23 05:59:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:08,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:08,954 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-23 05:59:08,954 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-23 05:59:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:09,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 05:59:09,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:09,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:09,203 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:59:09,204 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-23 05:59:09,251 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-23 05:59:09,259 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-23 05:59:09,369 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:09,369 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-23 05:59:09,374 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-23 05:59:09,444 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:09,445 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-23 05:59:09,449 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-23 05:59:09,535 INFO L356 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2022-07-23 05:59:09,536 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-23 05:59:09,602 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-23 05:59:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:59:09,854 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-23 05:59:09,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:10,159 WARN L833 $PredicateComparison]: unable to prove that (and (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| |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 (= (bvadd (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0)) (_ bv1 1)) (_ bv0 1)) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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-23 05:59:10,175 WARN L833 $PredicateComparison]: unable to prove that (and (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 (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|) (= (bvadd (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0)) (_ bv1 1)) (_ bv0 1))))) (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)))) is different from false [2022-07-23 05:59:10,205 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (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))) (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 ((.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 (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|) (= (bvadd (_ bv1 1) (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0))) (_ bv0 1)))))) is different from false [2022-07-23 05:59:10,229 WARN L833 $PredicateComparison]: unable to prove that (and (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 ((.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_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 (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|) (= (_ bv0 1) (bvadd (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0)) (_ bv1 1)))))) (forall ((v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (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| .cse2 v_ArrVal_790) (select (select (store |c_#memory_$Pointer$.base| .cse2 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-23 05:59:10,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:10,256 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-23 05:59:10,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:10,261 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 28 treesize of output 29 [2022-07-23 05:59:10,264 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 50 treesize of output 42 [2022-07-23 05:59:10,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:10,277 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 166 treesize of output 161 [2022-07-23 05:59:10,282 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 146 treesize of output 136 [2022-07-23 05:59:10,286 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 114 treesize of output 110 [2022-07-23 05:59:10,291 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 110 treesize of output 98 [2022-07-23 05:59:10,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:10,377 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 81 treesize of output 57 [2022-07-23 05:59:10,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:10,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:10,382 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 83 treesize of output 55 [2022-07-23 05:59:10,387 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 27 treesize of output 23 [2022-07-23 05:59:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:10,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:10,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478271356] [2022-07-23 05:59:10,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478271356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:59:10,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:59:10,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-23 05:59:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879368935] [2022-07-23 05:59:10,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:59:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 05:59:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 05:59:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=345, Unknown=4, NotChecked=164, Total=600 [2022-07-23 05:59:10,598 INFO L87 Difference]: Start difference. First operand 516 states and 649 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 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-23 05:59:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:12,103 INFO L93 Difference]: Finished difference Result 604 states and 770 transitions. [2022-07-23 05:59:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:59:12,104 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 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 34 [2022-07-23 05:59:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:12,105 INFO L225 Difference]: With dead ends: 604 [2022-07-23 05:59:12,105 INFO L226 Difference]: Without dead ends: 604 [2022-07-23 05:59:12,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=635, Unknown=4, NotChecked=228, Total=1056 [2022-07-23 05:59:12,108 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 160 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1084 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:12,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 752 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 664 Invalid, 0 Unknown, 1084 Unchecked, 0.9s Time] [2022-07-23 05:59:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-07-23 05:59:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 526. [2022-07-23 05:59:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 484 states have (on average 1.3636363636363635) internal successors, (660), 525 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 660 transitions. [2022-07-23 05:59:12,145 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 660 transitions. Word has length 34 [2022-07-23 05:59:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:12,146 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 660 transitions. [2022-07-23 05:59:12,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 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-23 05:59:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 660 transitions. [2022-07-23 05:59:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:59:12,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:12,146 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-23 05:59:12,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:12,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:12,354 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash 742188429, now seen corresponding path program 1 times [2022-07-23 05:59:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:12,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112284818] [2022-07-23 05:59:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:12,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:12,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:12,357 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:12,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-23 05:59:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:12,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 05:59:12,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:12,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:12,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:12,561 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:59:12,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:59:12,591 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-23 05:59:12,601 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-23 05:59:12,693 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:12,694 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-23 05:59:12,699 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-23 05:59:12,765 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:12,765 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-23 05:59:12,777 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-23 05:59:12,853 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-23 05:59:12,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-23 05:59:12,897 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 33 treesize of output 17 [2022-07-23 05:59:12,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:59:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:13,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:13,790 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_852 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_852) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|)))) is different from false [2022-07-23 05:59:13,819 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (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_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|) (forall ((v_ArrVal_852 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_852) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) (forall ((v_ArrVal_850 (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_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 05:59:13,875 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_852 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_849))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_848) .cse0 v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_852) (select (select (store .cse1 .cse0 v_ArrVal_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_849))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_851)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|))) (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_848) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 05:59:13,942 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse0 (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_849))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_851)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|) (forall ((v_ArrVal_852 (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_849))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_848) .cse2 v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_852) (select (select (store .cse3 .cse2 v_ArrVal_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))))) (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse4 (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| .cse4 v_ArrVal_848) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_849) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_850)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 05:59:13,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:13,976 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-23 05:59:13,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:13,982 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 28 treesize of output 29 [2022-07-23 05:59:13,984 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 50 treesize of output 42 [2022-07-23 05:59:13,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:13,997 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 100 treesize of output 99 [2022-07-23 05:59:14,002 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 60 treesize of output 52 [2022-07-23 05:59:14,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-23 05:59:14,009 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 74 treesize of output 68 [2022-07-23 05:59:14,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:14,061 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 76 treesize of output 77 [2022-07-23 05:59:14,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:14,070 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 105 treesize of output 73 [2022-07-23 05:59:14,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:14,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:14,090 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 109 treesize of output 73 [2022-07-23 05:59:14,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:14,096 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 48 treesize of output 36 [2022-07-23 05:59:14,101 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 26 treesize of output 22 [2022-07-23 05:59:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:14,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112284818] [2022-07-23 05:59:14,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112284818] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:59:14,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:59:14,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-07-23 05:59:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473153192] [2022-07-23 05:59:14,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:59:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 05:59:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 05:59:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=404, Unknown=4, NotChecked=172, Total=650 [2022-07-23 05:59:14,599 INFO L87 Difference]: Start difference. First operand 526 states and 660 transitions. Second operand has 26 states, 25 states have (on average 2.56) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:20,479 INFO L93 Difference]: Finished difference Result 1075 states and 1337 transitions. [2022-07-23 05:59:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-23 05:59:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 26 states have internal predecessors, (64), 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-23 05:59:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:20,482 INFO L225 Difference]: With dead ends: 1075 [2022-07-23 05:59:20,482 INFO L226 Difference]: Without dead ends: 1075 [2022-07-23 05:59:20,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=395, Invalid=1687, Unknown=4, NotChecked=364, Total=2450 [2022-07-23 05:59:20,484 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 714 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1547 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:20,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 983 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1503 Invalid, 0 Unknown, 1547 Unchecked, 3.4s Time] [2022-07-23 05:59:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-07-23 05:59:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 786. [2022-07-23 05:59:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 744 states have (on average 1.3776881720430108) internal successors, (1025), 785 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1025 transitions. [2022-07-23 05:59:20,520 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1025 transitions. Word has length 34 [2022-07-23 05:59:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:20,520 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1025 transitions. [2022-07-23 05:59:20,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1025 transitions. [2022-07-23 05:59:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:59:20,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:20,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:20,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:20,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:20,729 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1533003794, now seen corresponding path program 1 times [2022-07-23 05:59:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:20,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140395355] [2022-07-23 05:59:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:20,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:20,731 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:20,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-23 05:59:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:20,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:59:20,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:59:20,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:59:20,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:20,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140395355] [2022-07-23 05:59:20,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140395355] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:59:20,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:59:20,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2022-07-23 05:59:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867492009] [2022-07-23 05:59:20,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:59:20,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:59:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:59:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:59:20,982 INFO L87 Difference]: Start difference. First operand 786 states and 1025 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:21,271 INFO L93 Difference]: Finished difference Result 843 states and 1095 transitions. [2022-07-23 05:59:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:59:21,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 35 [2022-07-23 05:59:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:21,274 INFO L225 Difference]: With dead ends: 843 [2022-07-23 05:59:21,274 INFO L226 Difference]: Without dead ends: 843 [2022-07-23 05:59:21,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:59:21,274 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 252 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:21,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 337 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:59:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-07-23 05:59:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 788. [2022-07-23 05:59:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 746 states have (on average 1.3780160857908847) internal successors, (1028), 787 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1028 transitions. [2022-07-23 05:59:21,290 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1028 transitions. Word has length 35 [2022-07-23 05:59:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:21,291 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1028 transitions. [2022-07-23 05:59:21,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1028 transitions. [2022-07-23 05:59:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:59:21,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:21,292 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:21,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-23 05:59:21,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:21,500 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash -396121760, now seen corresponding path program 2 times [2022-07-23 05:59:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:21,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956374040] [2022-07-23 05:59:21,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:59:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:21,502 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:21,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-23 05:59:21,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:59:21,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:59:21,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 05:59:21,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:21,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:21,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:59:21,710 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-23 05:59:21,710 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 29 treesize of output 22 [2022-07-23 05:59:21,751 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-23 05:59:21,751 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 25 [2022-07-23 05:59:21,781 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-23 05:59:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:21,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:21,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:21,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956374040] [2022-07-23 05:59:21,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956374040] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:59:21,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:59:21,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-23 05:59:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192593490] [2022-07-23 05:59:21,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:59:21,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 05:59:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 05:59:21,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-23 05:59:21,904 INFO L87 Difference]: Start difference. First operand 788 states and 1028 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:23,524 INFO L93 Difference]: Finished difference Result 930 states and 1183 transitions. [2022-07-23 05:59:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:59:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 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 35 [2022-07-23 05:59:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:23,527 INFO L225 Difference]: With dead ends: 930 [2022-07-23 05:59:23,527 INFO L226 Difference]: Without dead ends: 930 [2022-07-23 05:59:23,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-07-23 05:59:23,527 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 235 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:23,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 737 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-23 05:59:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-07-23 05:59:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 834. [2022-07-23 05:59:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 792 states have (on average 1.3724747474747474) internal successors, (1087), 833 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1087 transitions. [2022-07-23 05:59:23,553 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1087 transitions. Word has length 35 [2022-07-23 05:59:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:23,553 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1087 transitions. [2022-07-23 05:59:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1087 transitions. [2022-07-23 05:59:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:59:23,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:23,554 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:23,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:23,758 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -396121759, now seen corresponding path program 1 times [2022-07-23 05:59:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499781094] [2022-07-23 05:59:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:23,760 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:23,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-23 05:59:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:23,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-23 05:59:23,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:23,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:59:23,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 05:59:24,094 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-23 05:59:24,095 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-23 05:59:24,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:24,103 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-23 05:59:24,156 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-23 05:59:24,157 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 34 treesize of output 23 [2022-07-23 05:59:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:24,163 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 30 treesize of output 23 [2022-07-23 05:59:24,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:59:24,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:59:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:24,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:24,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:24,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499781094] [2022-07-23 05:59:24,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499781094] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:59:24,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:59:24,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-07-23 05:59:24,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582874682] [2022-07-23 05:59:24,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:59:24,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 05:59:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 05:59:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-07-23 05:59:24,660 INFO L87 Difference]: Start difference. First operand 834 states and 1087 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:26,338 INFO L93 Difference]: Finished difference Result 915 states and 1171 transitions. [2022-07-23 05:59:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:59:26,339 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 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 35 [2022-07-23 05:59:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:26,341 INFO L225 Difference]: With dead ends: 915 [2022-07-23 05:59:26,341 INFO L226 Difference]: Without dead ends: 915 [2022-07-23 05:59:26,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-07-23 05:59:26,342 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 134 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:26,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1840 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-23 05:59:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-07-23 05:59:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 834. [2022-07-23 05:59:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 792 states have (on average 1.371212121212121) internal successors, (1086), 833 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1086 transitions. [2022-07-23 05:59:26,369 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1086 transitions. Word has length 35 [2022-07-23 05:59:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:26,369 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1086 transitions. [2022-07-23 05:59:26,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1086 transitions. [2022-07-23 05:59:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 05:59:26,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:26,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:26,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:26,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:26,581 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash 278482478, now seen corresponding path program 1 times [2022-07-23 05:59:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:26,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228498343] [2022-07-23 05:59:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:26,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:26,583 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:26,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-23 05:59:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:26,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:59:26,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:26,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 05:59:26,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:59:26,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228498343] [2022-07-23 05:59:26,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228498343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:59:26,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:59:26,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:59:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197764010] [2022-07-23 05:59:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:59:26,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:59:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:59:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:59:26,754 INFO L87 Difference]: Start difference. First operand 834 states and 1086 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:26,902 INFO L93 Difference]: Finished difference Result 836 states and 1089 transitions. [2022-07-23 05:59:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:59:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-23 05:59:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:26,905 INFO L225 Difference]: With dead ends: 836 [2022-07-23 05:59:26,905 INFO L226 Difference]: Without dead ends: 836 [2022-07-23 05:59:26,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:59:26,905 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:26,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 178 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:59:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-07-23 05:59:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 834. [2022-07-23 05:59:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 794 states have (on average 1.3702770780856424) internal successors, (1088), 833 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1088 transitions. [2022-07-23 05:59:26,917 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1088 transitions. Word has length 36 [2022-07-23 05:59:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:26,917 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1088 transitions. [2022-07-23 05:59:26,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1088 transitions. [2022-07-23 05:59:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 05:59:26,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:26,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:27,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:27,126 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 278482479, now seen corresponding path program 1 times [2022-07-23 05:59:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:27,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827078566] [2022-07-23 05:59:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:27,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:27,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:27,129 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:27,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-23 05:59:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:27,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:59:27,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:27,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 05:59:27,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:59:27,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:59:27,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827078566] [2022-07-23 05:59:27,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827078566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:59:27,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:59:27,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:59:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162767840] [2022-07-23 05:59:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:59:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:59:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:59:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:59:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:59:27,265 INFO L87 Difference]: Start difference. First operand 834 states and 1088 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:27,441 INFO L93 Difference]: Finished difference Result 836 states and 1088 transitions. [2022-07-23 05:59:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:59:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-23 05:59:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:27,443 INFO L225 Difference]: With dead ends: 836 [2022-07-23 05:59:27,444 INFO L226 Difference]: Without dead ends: 836 [2022-07-23 05:59:27,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:59:27,444 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:27,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 173 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:59:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-07-23 05:59:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 832. [2022-07-23 05:59:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 794 states have (on average 1.3664987405541562) internal successors, (1085), 831 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1085 transitions. [2022-07-23 05:59:27,468 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1085 transitions. Word has length 36 [2022-07-23 05:59:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:27,468 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1085 transitions. [2022-07-23 05:59:27,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1085 transitions. [2022-07-23 05:59:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 05:59:27,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:27,469 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:27,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:27,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 05:59:27,676 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-07-23 05:59:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash 99445590, now seen corresponding path program 1 times [2022-07-23 05:59:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:59:27,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260870594] [2022-07-23 05:59:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:27,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:59:27,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:59:27,679 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 05:59:27,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-23 05:59:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:27,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 05:59:27,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:27,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:59:27,895 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:59:27,895 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-23 05:59:27,917 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-23 05:59:27,992 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:27,992 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 28 treesize of output 29 [2022-07-23 05:59:28,066 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:28,066 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 28 treesize of output 29 [2022-07-23 05:59:28,132 INFO L356 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2022-07-23 05:59:28,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 49 [2022-07-23 05:59:28,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:28,176 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 41 treesize of output 32 [2022-07-23 05:59:28,322 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:28,323 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 56 treesize of output 51 [2022-07-23 05:59:28,427 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:59:28,427 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 56 treesize of output 51 [2022-07-23 05:59:28,595 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 05:59:28,595 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 51 treesize of output 23 [2022-07-23 05:59:28,642 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-23 05:59:28,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:28,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (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_1189))) (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_1190)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 05:59:28,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (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_1189))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1190))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 05:59:28,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (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 (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_1189))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1190))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 05:59:28,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc18#1.base_22| (_ BitVec 32)) (v_ArrVal_1186 (_ BitVec 1)) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_22| v_ArrVal_1186) (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_22|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_22| v_ArrVal_1189))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1190))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_22|))))) is different from false [2022-07-23 05:59:29,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:29,850 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 163 treesize of output 108 [2022-07-23 05:59:29,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:30,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:30,010 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 5618742 treesize of output 5601148 [2022-07-23 05:59:43,954 WARN L233 SmtUtils]: Spent 13.94s on a formula simplification that was a NOOP. DAG size: 2529 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:44,033 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 6000494 treesize of output 5900014 [2022-07-23 05:59:59,047 WARN L233 SmtUtils]: Spent 15.01s on a formula simplification that was a NOOP. DAG size: 2530 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:59,123 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 5900014 treesize of output 5764334 [2022-07-23 06:00:13,918 WARN L233 SmtUtils]: Spent 14.79s on a formula simplification that was a NOOP. DAG size: 2529 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:14,071 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 5764334 treesize of output 5492974 [2022-07-23 06:00:29,516 WARN L233 SmtUtils]: Spent 15.44s on a formula simplification that was a NOOP. DAG size: 2528 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:29,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:00:29,692 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 5497582 treesize of output 5475698 [2022-07-23 06:00:44,848 WARN L233 SmtUtils]: Spent 15.15s on a formula simplification that was a NOOP. DAG size: 2529 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:02:07,325 WARN L233 SmtUtils]: Spent 52.78s on a formula simplification. DAG size of input: 2518 DAG size of output: 2518 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)