./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:54:44,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:54:44,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:54:44,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:54:44,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:54:44,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:54:44,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:54:44,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:54:44,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:54:44,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:54:44,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:54:44,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:54:44,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:54:44,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:54:44,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:54:44,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:54:44,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:54:44,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:54:44,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:54:44,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:54:44,822 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:54:44,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:54:44,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:54:44,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:54:44,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:54:44,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:54:44,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:54:44,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:54:44,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:54:44,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:54:44,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:54:44,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:54:44,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:54:44,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:54:44,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:54:44,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:54:44,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:54:44,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:54:44,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:54:44,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:54:44,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:54:44,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:54:44,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 23:54:44,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:54:44,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:54:44,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:54:44,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:54:44,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:54:44,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:54:44,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:54:44,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:54:44,889 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:54:44,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:54:44,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 23:54:44,890 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:54:44,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:54:44,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 23:54:44,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:54:44,891 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:54:44,891 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:54:44,891 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:54:44,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:54:44,892 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:54:44,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 23:54:44,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:54:44,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:54:44,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:54:44,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:54:44,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:54:44,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:54:44,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:54:44,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 23:54:44,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 23:54:44,894 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 -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2022-07-21 23:54:45,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:54:45,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:54:45,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:54:45,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:54:45,253 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:54:45,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2022-07-21 23:54:45,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc32de8de/e17e89942961412588b2aa12ab237fc3/FLAGc8cb0944f [2022-07-21 23:54:45,860 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:54:45,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2022-07-21 23:54:45,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc32de8de/e17e89942961412588b2aa12ab237fc3/FLAGc8cb0944f [2022-07-21 23:54:46,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc32de8de/e17e89942961412588b2aa12ab237fc3 [2022-07-21 23:54:46,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:54:46,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:54:46,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:54:46,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:54:46,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:54:46,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:54:46" (1/1) ... [2022-07-21 23:54:46,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be2a446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:46, skipping insertion in model container [2022-07-21 23:54:46,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:54:46" (1/1) ... [2022-07-21 23:54:46,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:54:46,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:54:46,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2022-07-21 23:54:46,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2022-07-21 23:54:46,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:54:46,794 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-21 23:54:46,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@bbd8d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:46, skipping insertion in model container [2022-07-21 23:54:46,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:54:46,797 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 23:54:46,800 INFO L158 Benchmark]: Toolchain (without parser) took 630.28ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.6MB in the beginning and 31.7MB in the end (delta: -9.1MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-07-21 23:54:46,801 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 23:54:46,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.73ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.4MB in the beginning and 31.7MB in the end (delta: -9.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-07-21 23:54:46,805 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.19ms. Allocated memory is still 48.2MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.73ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.4MB in the beginning and 31.7MB in the end (delta: -9.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:54:48,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:54:48,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:54:48,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:54:48,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:54:48,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:54:48,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:54:48,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:54:48,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:54:48,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:54:48,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:54:48,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:54:48,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:54:48,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:54:48,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:54:48,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:54:48,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:54:48,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:54:48,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:54:48,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:54:48,622 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:54:48,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:54:48,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:54:48,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:54:48,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:54:48,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:54:48,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:54:48,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:54:48,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:54:48,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:54:48,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:54:48,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:54:48,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:54:48,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:54:48,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:54:48,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:54:48,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:54:48,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:54:48,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:54:48,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:54:48,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:54:48,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:54:48,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 23:54:48,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:54:48,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:54:48,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:54:48,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:54:48,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:54:48,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:54:48,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:54:48,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:54:48,681 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:54:48,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:54:48,682 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 23:54:48,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:54:48,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:54:48,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 23:54:48,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:54:48,683 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:54:48,683 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:54:48,683 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:54:48,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:54:48,684 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:54:48,684 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 23:54:48,684 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 23:54:48,685 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 23:54:48,685 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:54:48,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:54:48,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:54:48,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:54:48,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:54:48,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:54:48,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:54:48,686 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 23:54:48,687 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 23:54:48,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 23:54:48,687 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 -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2022-07-21 23:54:49,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:54:49,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:54:49,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:54:49,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:54:49,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:54:49,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2022-07-21 23:54:49,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b4e77b/7a477be0690d4bebad3b701f5de5b1b9/FLAGb9b5eee65 [2022-07-21 23:54:49,691 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:54:49,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2022-07-21 23:54:49,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b4e77b/7a477be0690d4bebad3b701f5de5b1b9/FLAGb9b5eee65 [2022-07-21 23:54:50,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b4e77b/7a477be0690d4bebad3b701f5de5b1b9 [2022-07-21 23:54:50,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:54:50,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:54:50,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:54:50,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:54:50,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:54:50,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:50,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0eaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50, skipping insertion in model container [2022-07-21 23:54:50,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:50,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:54:50,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:54:50,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2022-07-21 23:54:50,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2022-07-21 23:54:50,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:54:50,707 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 23:54:50,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:54:50,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2022-07-21 23:54:50,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2022-07-21 23:54:50,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:54:50,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 23:54:50,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2022-07-21 23:54:50,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2022-07-21 23:54:50,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:54:50,952 INFO L208 MainTranslator]: Completed translation [2022-07-21 23:54:50,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50 WrapperNode [2022-07-21 23:54:50,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:54:50,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 23:54:50,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 23:54:50,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 23:54:50,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:50,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,062 INFO L137 Inliner]: procedures = 180, calls = 348, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1175 [2022-07-21 23:54:51,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 23:54:51,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 23:54:51,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 23:54:51,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 23:54:51,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 23:54:51,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 23:54:51,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 23:54:51,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 23:54:51,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (1/1) ... [2022-07-21 23:54:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:54:51,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 23:54:51,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 23:54:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 23:54:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 23:54:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 23:54:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 23:54:51,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 23:54:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 23:54:51,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 23:54:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-07-21 23:54:51,252 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-07-21 23:54:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 23:54:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 23:54:51,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 23:54:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 23:54:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-21 23:54:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 23:54:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 23:54:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 23:54:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 23:54:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 23:54:51,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 23:54:51,488 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 23:54:51,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 23:54:51,495 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 23:54:55,759 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 23:54:55,770 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 23:54:55,771 INFO L299 CfgBuilder]: Removed 71 assume(true) statements. [2022-07-21 23:54:55,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:54:55 BoogieIcfgContainer [2022-07-21 23:54:55,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 23:54:55,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 23:54:55,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 23:54:55,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 23:54:55,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:54:50" (1/3) ... [2022-07-21 23:54:55,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca7da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:54:55, skipping insertion in model container [2022-07-21 23:54:55,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:54:50" (2/3) ... [2022-07-21 23:54:55,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca7da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:54:55, skipping insertion in model container [2022-07-21 23:54:55,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:54:55" (3/3) ... [2022-07-21 23:54:55,781 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-2.i [2022-07-21 23:54:55,794 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 23:54:55,794 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 641 error locations. [2022-07-21 23:54:55,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 23:54:55,849 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@31373fae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d973ce3 [2022-07-21 23:54:55,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 641 error locations. [2022-07-21 23:54:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 1296 states, 634 states have (on average 2.2539432176656153) internal successors, (1429), 1287 states have internal predecessors, (1429), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 23:54:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 23:54:55,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:54:55,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 23:54:55,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:54:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:54:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-07-21 23:54:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:54:55,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546195309] [2022-07-21 23:54:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:54:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:54:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:54:55,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:54:55,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 23:54:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:54:56,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:54:56,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:54:56,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:54:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:54:56,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:54:56,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:54:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546195309] [2022-07-21 23:54:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546195309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:54:56,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:54:56,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:54:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367378523] [2022-07-21 23:54:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:54:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:54:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:54:56,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:54:56,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:54:56,251 INFO L87 Difference]: Start difference. First operand has 1296 states, 634 states have (on average 2.2539432176656153) internal successors, (1429), 1287 states have internal predecessors, (1429), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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-21 23:54:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:54:58,191 INFO L93 Difference]: Finished difference Result 1476 states and 1582 transitions. [2022-07-21 23:54:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:54:58,194 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-21 23:54:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:54:58,212 INFO L225 Difference]: With dead ends: 1476 [2022-07-21 23:54:58,212 INFO L226 Difference]: Without dead ends: 1474 [2022-07-21 23:54:58,213 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-21 23:54:58,216 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1162 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:54:58,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1048 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 23:54:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-07-21 23:54:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1285. [2022-07-21 23:54:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 637 states have (on average 2.111459968602826) internal successors, (1345), 1275 states have internal predecessors, (1345), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-21 23:54:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1387 transitions. [2022-07-21 23:54:58,336 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1387 transitions. Word has length 3 [2022-07-21 23:54:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:54:58,336 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1387 transitions. [2022-07-21 23:54:58,337 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-21 23:54:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1387 transitions. [2022-07-21 23:54:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 23:54:58,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:54:58,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 23:54:58,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 23:54:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:54:58,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:54:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:54:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-07-21 23:54:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:54:58,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284401708] [2022-07-21 23:54:58,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:54:58,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:54:58,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:54:58,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:54:58,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 23:54:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:54:58,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:54:58,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:54:58,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:54:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:54:58,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:54:58,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:54:58,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284401708] [2022-07-21 23:54:58,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284401708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:54:58,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:54:58,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:54:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610733491] [2022-07-21 23:54:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:54:58,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:54:58,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:54:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:54:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:54:58,694 INFO L87 Difference]: Start difference. First operand 1285 states and 1387 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-21 23:55:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:01,676 INFO L93 Difference]: Finished difference Result 1877 states and 2020 transitions. [2022-07-21 23:55:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:55:01,677 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-21 23:55:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:01,684 INFO L225 Difference]: With dead ends: 1877 [2022-07-21 23:55:01,684 INFO L226 Difference]: Without dead ends: 1877 [2022-07-21 23:55:01,685 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-21 23:55:01,686 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 631 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:01,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1840 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 23:55:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2022-07-21 23:55:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1489. [2022-07-21 23:55:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 841 states have (on average 2.097502972651605) internal successors, (1764), 1478 states have internal predecessors, (1764), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-21 23:55:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1808 transitions. [2022-07-21 23:55:01,723 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1808 transitions. Word has length 3 [2022-07-21 23:55:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:01,724 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1808 transitions. [2022-07-21 23:55:01,724 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-21 23:55:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1808 transitions. [2022-07-21 23:55:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 23:55:01,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:01,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:01,735 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-21 23:55:01,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:01,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-07-21 23:55:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:01,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238787661] [2022-07-21 23:55:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:01,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:01,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:01,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 23:55:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:02,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 23:55:02,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:02,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:02,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:02,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 23:55:02,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 23:55:02,150 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:55:02,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-21 23:55:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:02,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:02,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238787661] [2022-07-21 23:55:02,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238787661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:02,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:02,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685426015] [2022-07-21 23:55:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:02,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:02,175 INFO L87 Difference]: Start difference. First operand 1489 states and 1808 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:05,008 INFO L93 Difference]: Finished difference Result 1671 states and 1997 transitions. [2022-07-21 23:55:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:55:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-21 23:55:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:05,016 INFO L225 Difference]: With dead ends: 1671 [2022-07-21 23:55:05,016 INFO L226 Difference]: Without dead ends: 1671 [2022-07-21 23:55:05,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:05,017 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 2605 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:05,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 645 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 23:55:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-07-21 23:55:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1274. [2022-07-21 23:55:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 637 states have (on average 2.0926216640502355) internal successors, (1333), 1264 states have internal predecessors, (1333), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-21 23:55:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1375 transitions. [2022-07-21 23:55:05,052 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1375 transitions. Word has length 7 [2022-07-21 23:55:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:05,053 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1375 transitions. [2022-07-21 23:55:05,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1375 transitions. [2022-07-21 23:55:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 23:55:05,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:05,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:05,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:05,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-07-21 23:55:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:05,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637708589] [2022-07-21 23:55:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:05,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:05,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 23:55:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:05,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:55:05,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:05,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:05,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:05,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:05,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637708589] [2022-07-21 23:55:05,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637708589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:05,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:05,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:55:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499627048] [2022-07-21 23:55:05,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:05,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:55:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:55:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:05,415 INFO L87 Difference]: Start difference. First operand 1274 states and 1375 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:07,148 INFO L93 Difference]: Finished difference Result 1601 states and 1729 transitions. [2022-07-21 23:55:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:55:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-21 23:55:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:07,154 INFO L225 Difference]: With dead ends: 1601 [2022-07-21 23:55:07,155 INFO L226 Difference]: Without dead ends: 1601 [2022-07-21 23:55:07,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:07,156 INFO L413 NwaCegarLoop]: 1204 mSDtfsCounter, 988 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:07,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1610 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 23:55:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-21 23:55:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1227. [2022-07-21 23:55:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 637 states have (on average 2.0172684458398744) internal successors, (1285), 1217 states have internal predecessors, (1285), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-21 23:55:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1327 transitions. [2022-07-21 23:55:07,182 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1327 transitions. Word has length 8 [2022-07-21 23:55:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:07,183 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 1327 transitions. [2022-07-21 23:55:07,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1327 transitions. [2022-07-21 23:55:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 23:55:07,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:07,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:07,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:07,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-07-21 23:55:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:07,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51594275] [2022-07-21 23:55:07,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:07,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:07,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:07,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:07,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 23:55:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:07,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:55:07,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:07,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:07,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-21 23:55:07,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:07,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:07,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51594275] [2022-07-21 23:55:07,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51594275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:07,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:07,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:55:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228657581] [2022-07-21 23:55:07,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:07,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:55:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:07,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:55:07,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:07,534 INFO L87 Difference]: Start difference. First operand 1227 states and 1327 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:09,695 INFO L93 Difference]: Finished difference Result 1694 states and 1828 transitions. [2022-07-21 23:55:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:55:09,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-21 23:55:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:09,703 INFO L225 Difference]: With dead ends: 1694 [2022-07-21 23:55:09,703 INFO L226 Difference]: Without dead ends: 1694 [2022-07-21 23:55:09,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:09,705 INFO L413 NwaCegarLoop]: 1421 mSDtfsCounter, 684 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:09,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2010 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 23:55:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-07-21 23:55:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1469. [2022-07-21 23:55:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 887 states have (on average 2.0056369785794814) internal successors, (1779), 1457 states have internal predecessors, (1779), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-21 23:55:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1825 transitions. [2022-07-21 23:55:09,734 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1825 transitions. Word has length 8 [2022-07-21 23:55:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:09,734 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 1825 transitions. [2022-07-21 23:55:09,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1825 transitions. [2022-07-21 23:55:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 23:55:09,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:09,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:09,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:09,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:09,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1255764539, now seen corresponding path program 1 times [2022-07-21 23:55:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030040257] [2022-07-21 23:55:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:09,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:09,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:09,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 23:55:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:10,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:55:10,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:10,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:10,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030040257] [2022-07-21 23:55:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030040257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:10,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:10,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29085871] [2022-07-21 23:55:10,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:10,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:55:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:55:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:10,163 INFO L87 Difference]: Start difference. First operand 1469 states and 1825 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:10,520 INFO L93 Difference]: Finished difference Result 2286 states and 2860 transitions. [2022-07-21 23:55:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:55:10,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 23:55:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:10,530 INFO L225 Difference]: With dead ends: 2286 [2022-07-21 23:55:10,530 INFO L226 Difference]: Without dead ends: 2286 [2022-07-21 23:55:10,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:10,532 INFO L413 NwaCegarLoop]: 1443 mSDtfsCounter, 748 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:10,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2563 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 23:55:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-21 23:55:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 1869. [2022-07-21 23:55:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1285 states have (on average 1.9883268482490273) internal successors, (2555), 1855 states have internal predecessors, (2555), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2605 transitions. [2022-07-21 23:55:10,571 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2605 transitions. Word has length 11 [2022-07-21 23:55:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:10,572 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2605 transitions. [2022-07-21 23:55:10,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2605 transitions. [2022-07-21 23:55:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 23:55:10,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:10,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:10,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:10,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:10,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:10,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash -680989669, now seen corresponding path program 1 times [2022-07-21 23:55:10,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:10,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214348940] [2022-07-21 23:55:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:10,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:10,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:10,786 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:10,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 23:55:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:10,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 23:55:10,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:10,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:10,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:10,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214348940] [2022-07-21 23:55:10,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214348940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:10,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:10,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444241417] [2022-07-21 23:55:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:10,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:55:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:10,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:55:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:10,922 INFO L87 Difference]: Start difference. First operand 1869 states and 2605 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-21 23:55:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:10,954 INFO L93 Difference]: Finished difference Result 1992 states and 2665 transitions. [2022-07-21 23:55:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:55:10,955 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-21 23:55:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:10,962 INFO L225 Difference]: With dead ends: 1992 [2022-07-21 23:55:10,962 INFO L226 Difference]: Without dead ends: 1992 [2022-07-21 23:55:10,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:10,963 INFO L413 NwaCegarLoop]: 1462 mSDtfsCounter, 585 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:10,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2352 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:55:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-07-21 23:55:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1773. [2022-07-21 23:55:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1213 states have (on average 1.964550700741962) internal successors, (2383), 1759 states have internal predecessors, (2383), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2433 transitions. [2022-07-21 23:55:11,010 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2433 transitions. Word has length 13 [2022-07-21 23:55:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:11,011 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2433 transitions. [2022-07-21 23:55:11,011 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-21 23:55:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2433 transitions. [2022-07-21 23:55:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 23:55:11,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:11,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:11,023 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-21 23:55:11,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:11,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr639ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1323693751, now seen corresponding path program 1 times [2022-07-21 23:55:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:11,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958403865] [2022-07-21 23:55:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:11,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:11,224 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:11,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 23:55:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:11,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 23:55:11,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:11,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 23:55:11,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 23:55:11,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 23:55:11,445 INFO L356 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2022-07-21 23:55:11,446 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 3 case distinctions, treesize of input 30 treesize of output 36 [2022-07-21 23:55:11,488 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-21 23:55:11,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2022-07-21 23:55:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:11,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:11,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:11,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958403865] [2022-07-21 23:55:11,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958403865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:11,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:11,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:55:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515176501] [2022-07-21 23:55:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:11,503 INFO L87 Difference]: Start difference. First operand 1773 states and 2433 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:12,632 INFO L93 Difference]: Finished difference Result 2415 states and 3336 transitions. [2022-07-21 23:55:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:55:12,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-21 23:55:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:12,641 INFO L225 Difference]: With dead ends: 2415 [2022-07-21 23:55:12,641 INFO L226 Difference]: Without dead ends: 2415 [2022-07-21 23:55:12,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:12,642 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 461 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:12,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3538 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 23:55:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-21 23:55:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1772. [2022-07-21 23:55:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1212 states have (on average 1.9645214521452146) internal successors, (2381), 1758 states have internal predecessors, (2381), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2431 transitions. [2022-07-21 23:55:12,690 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2431 transitions. Word has length 14 [2022-07-21 23:55:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:12,690 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2431 transitions. [2022-07-21 23:55:12,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2431 transitions. [2022-07-21 23:55:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 23:55:12,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:12,692 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-21 23:55:12,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:12,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:12,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-07-21 23:55:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:12,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793917715] [2022-07-21 23:55:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:12,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:12,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 23:55:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:13,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 23:55:13,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:13,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:13,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:13,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793917715] [2022-07-21 23:55:13,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793917715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:13,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:13,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526923290] [2022-07-21 23:55:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:13,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:55:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:55:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:13,092 INFO L87 Difference]: Start difference. First operand 1772 states and 2431 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-21 23:55:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:13,121 INFO L93 Difference]: Finished difference Result 1712 states and 2345 transitions. [2022-07-21 23:55:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:55:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-21 23:55:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:13,128 INFO L225 Difference]: With dead ends: 1712 [2022-07-21 23:55:13,129 INFO L226 Difference]: Without dead ends: 1712 [2022-07-21 23:55:13,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:55:13,131 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 1131 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:13,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:55:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-21 23:55:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2022-07-21 23:55:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1176 states have (on average 1.9515306122448979) internal successors, (2295), 1698 states have internal predecessors, (2295), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2345 transitions. [2022-07-21 23:55:13,167 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2345 transitions. Word has length 18 [2022-07-21 23:55:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:13,168 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2345 transitions. [2022-07-21 23:55:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-21 23:55:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2345 transitions. [2022-07-21 23:55:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 23:55:13,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:13,169 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-21 23:55:13,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:13,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:13,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-07-21 23:55:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583107759] [2022-07-21 23:55:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:13,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:13,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:13,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 23:55:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:13,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:55:13,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:13,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:13,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:13,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583107759] [2022-07-21 23:55:13,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583107759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:13,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:13,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:55:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425071008] [2022-07-21 23:55:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:13,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:13,557 INFO L87 Difference]: Start difference. First operand 1712 states and 2345 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 23:55:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:13,626 INFO L93 Difference]: Finished difference Result 1684 states and 2289 transitions. [2022-07-21 23:55:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:55:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 23:55:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:13,631 INFO L225 Difference]: With dead ends: 1684 [2022-07-21 23:55:13,632 INFO L226 Difference]: Without dead ends: 1684 [2022-07-21 23:55:13,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:13,633 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1102 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:13,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2433 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:55:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-07-21 23:55:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1682. [2022-07-21 23:55:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1160 states have (on average 1.928448275862069) internal successors, (2237), 1668 states have internal predecessors, (2237), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2287 transitions. [2022-07-21 23:55:13,668 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2287 transitions. Word has length 20 [2022-07-21 23:55:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:13,668 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 2287 transitions. [2022-07-21 23:55:13,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 23:55:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2287 transitions. [2022-07-21 23:55:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 23:55:13,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:13,671 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] [2022-07-21 23:55:13,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:13,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:13,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-07-21 23:55:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10096342] [2022-07-21 23:55:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:13,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:13,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:13,884 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:13,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 23:55:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:14,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:55:14,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:14,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:14,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:14,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:14,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10096342] [2022-07-21 23:55:14,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10096342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:14,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:14,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211583682] [2022-07-21 23:55:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:14,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:14,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:14,115 INFO L87 Difference]: Start difference. First operand 1682 states and 2287 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:15,934 INFO L93 Difference]: Finished difference Result 2541 states and 3552 transitions. [2022-07-21 23:55:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 23:55:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-21 23:55:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:15,943 INFO L225 Difference]: With dead ends: 2541 [2022-07-21 23:55:15,943 INFO L226 Difference]: Without dead ends: 2541 [2022-07-21 23:55:15,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:15,944 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 2164 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:15,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1290 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 23:55:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2022-07-21 23:55:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1678. [2022-07-21 23:55:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1160 states have (on average 1.921551724137931) internal successors, (2229), 1664 states have internal predecessors, (2229), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2279 transitions. [2022-07-21 23:55:15,973 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2279 transitions. Word has length 34 [2022-07-21 23:55:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:15,974 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 2279 transitions. [2022-07-21 23:55:15,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2279 transitions. [2022-07-21 23:55:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 23:55:15,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:15,975 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] [2022-07-21 23:55:15,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:16,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:16,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-07-21 23:55:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741500798] [2022-07-21 23:55:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:16,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:16,189 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:16,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 23:55:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:16,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 23:55:16,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:16,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:16,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:16,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:16,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741500798] [2022-07-21 23:55:16,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741500798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:16,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:16,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143722355] [2022-07-21 23:55:16,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:16,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:16,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:16,480 INFO L87 Difference]: Start difference. First operand 1678 states and 2279 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:19,327 INFO L93 Difference]: Finished difference Result 2089 states and 2498 transitions. [2022-07-21 23:55:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 23:55:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-21 23:55:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:19,333 INFO L225 Difference]: With dead ends: 2089 [2022-07-21 23:55:19,333 INFO L226 Difference]: Without dead ends: 2089 [2022-07-21 23:55:19,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:19,334 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 1298 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:19,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2787 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 23:55:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-07-21 23:55:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1674. [2022-07-21 23:55:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1160 states have (on average 1.914655172413793) internal successors, (2221), 1660 states have internal predecessors, (2221), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2271 transitions. [2022-07-21 23:55:19,359 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2271 transitions. Word has length 34 [2022-07-21 23:55:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:19,359 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2271 transitions. [2022-07-21 23:55:19,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2271 transitions. [2022-07-21 23:55:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 23:55:19,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:19,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:19,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 23:55:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:19,572 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash -515146363, now seen corresponding path program 1 times [2022-07-21 23:55:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:19,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260828961] [2022-07-21 23:55:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:19,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:19,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:19,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 23:55:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:55:19,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:19,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:19,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260828961] [2022-07-21 23:55:19,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260828961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:19,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:19,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:55:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624629527] [2022-07-21 23:55:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:19,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:19,817 INFO L87 Difference]: Start difference. First operand 1674 states and 2271 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-21 23:55:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:19,857 INFO L93 Difference]: Finished difference Result 1662 states and 2251 transitions. [2022-07-21 23:55:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:55:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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 52 [2022-07-21 23:55:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:19,879 INFO L225 Difference]: With dead ends: 1662 [2022-07-21 23:55:19,880 INFO L226 Difference]: Without dead ends: 1662 [2022-07-21 23:55:19,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:19,882 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 1078 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:19,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2411 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:55:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2022-07-21 23:55:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2022-07-21 23:55:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1148 states have (on average 1.9172473867595818) internal successors, (2201), 1648 states have internal predecessors, (2201), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 23:55:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2251 transitions. [2022-07-21 23:55:19,911 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2251 transitions. Word has length 52 [2022-07-21 23:55:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:19,912 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2251 transitions. [2022-07-21 23:55:19,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-21 23:55:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2251 transitions. [2022-07-21 23:55:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 23:55:19,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:19,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:19,930 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-21 23:55:20,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:20,129 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-07-21 23:55:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:20,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739984] [2022-07-21 23:55:20,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:20,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:20,133 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:20,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 23:55:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:20,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 23:55:20,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:20,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:20,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:20,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 23:55:20,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 23:55:20,886 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:55:20,886 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-21 23:55:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:20,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:20,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739984] [2022-07-21 23:55:20,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:20,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:20,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:55:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345399636] [2022-07-21 23:55:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:20,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:20,905 INFO L87 Difference]: Start difference. First operand 1662 states and 2251 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:22,645 INFO L93 Difference]: Finished difference Result 1633 states and 2223 transitions. [2022-07-21 23:55:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:55:22,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-21 23:55:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:22,656 INFO L225 Difference]: With dead ends: 1633 [2022-07-21 23:55:22,657 INFO L226 Difference]: Without dead ends: 1633 [2022-07-21 23:55:22,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:22,657 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 833 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:22,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 888 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 23:55:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-21 23:55:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1250. [2022-07-21 23:55:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 779 states have (on average 1.8318356867779204) internal successors, (1427), 1239 states have internal predecessors, (1427), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-21 23:55:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1471 transitions. [2022-07-21 23:55:22,677 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1471 transitions. Word has length 60 [2022-07-21 23:55:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:22,677 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1471 transitions. [2022-07-21 23:55:22,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1471 transitions. [2022-07-21 23:55:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 23:55:22,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:22,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:22,696 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-21 23:55:22,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:55:22,894 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-07-21 23:55:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:22,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883728939] [2022-07-21 23:55:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:22,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:22,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:22,897 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:55:22,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 23:55:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:23,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 23:55:23,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:23,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:23,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:55:23,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 23:55:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:23,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:23,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:23,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883728939] [2022-07-21 23:55:23,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883728939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:23,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:23,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:55:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147024913] [2022-07-21 23:55:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:23,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 23:55:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 23:55:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:23,197 INFO L87 Difference]: Start difference. First operand 1250 states and 1471 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:25,180 INFO L93 Difference]: Finished difference Result 1249 states and 1470 transitions. [2022-07-21 23:55:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 23:55:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-07-21 23:55:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:25,183 INFO L225 Difference]: With dead ends: 1249 [2022-07-21 23:55:25,184 INFO L226 Difference]: Without dead ends: 1249 [2022-07-21 23:55:25,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:55:25,184 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 4 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:25,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2957 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 23:55:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-07-21 23:55:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2022-07-21 23:55:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 779 states have (on average 1.8305519897304237) internal successors, (1426), 1238 states have internal predecessors, (1426), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-21 23:55:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1470 transitions. [2022-07-21 23:55:25,201 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1470 transitions. Word has length 65 [2022-07-21 23:55:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:25,201 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1470 transitions. [2022-07-21 23:55:25,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1470 transitions. [2022-07-21 23:55:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 23:55:25,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:25,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:25,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-21 23:55:25,415 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-21 23:55:25,415 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-07-21 23:55:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:25,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205666992] [2022-07-21 23:55:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:25,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:25,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:25,418 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-21 23:55:25,419 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-21 23:55:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:25,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 23:55:25,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:25,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:25,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:55:25,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:55:25,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 23:55:25,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 23:55:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:25,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:25,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:25,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205666992] [2022-07-21 23:55:25,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205666992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:25,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:25,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:55:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916499899] [2022-07-21 23:55:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:25,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 23:55:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 23:55:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:25,791 INFO L87 Difference]: Start difference. First operand 1249 states and 1470 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:28,516 INFO L93 Difference]: Finished difference Result 1248 states and 1469 transitions. [2022-07-21 23:55:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 23:55:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-07-21 23:55:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:28,521 INFO L225 Difference]: With dead ends: 1248 [2022-07-21 23:55:28,521 INFO L226 Difference]: Without dead ends: 1248 [2022-07-21 23:55:28,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-21 23:55:28,522 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:28,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3018 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 23:55:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-07-21 23:55:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-07-21 23:55:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 778 states have (on average 1.8316195372750643) internal successors, (1425), 1237 states have internal predecessors, (1425), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-21 23:55:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1469 transitions. [2022-07-21 23:55:28,536 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1469 transitions. Word has length 65 [2022-07-21 23:55:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:28,536 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1469 transitions. [2022-07-21 23:55:28,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:55:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1469 transitions. [2022-07-21 23:55:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 23:55:28,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:28,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:28,551 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-21 23:55:28,751 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-21 23:55:28,751 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash 827014060, now seen corresponding path program 1 times [2022-07-21 23:55:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:28,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567035754] [2022-07-21 23:55:28,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:28,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:28,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:28,754 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-21 23:55:28,757 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-21 23:55:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:29,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:55:29,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:29,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:55:29,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:29,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567035754] [2022-07-21 23:55:29,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567035754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:55:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:55:29,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:55:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326360570] [2022-07-21 23:55:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:55:29,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:55:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:55:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:55:29,023 INFO L87 Difference]: Start difference. First operand 1248 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:55:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:29,070 INFO L93 Difference]: Finished difference Result 1251 states and 1473 transitions. [2022-07-21 23:55:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:55:29,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-07-21 23:55:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:29,083 INFO L225 Difference]: With dead ends: 1251 [2022-07-21 23:55:29,083 INFO L226 Difference]: Without dead ends: 1251 [2022-07-21 23:55:29,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:55:29,084 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:29,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3373 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 23:55:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-07-21 23:55:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2022-07-21 23:55:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 780 states have (on average 1.8307692307692307) internal successors, (1428), 1240 states have internal predecessors, (1428), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-21 23:55:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1473 transitions. [2022-07-21 23:55:29,133 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1473 transitions. Word has length 73 [2022-07-21 23:55:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:29,134 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1473 transitions. [2022-07-21 23:55:29,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:55:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1473 transitions. [2022-07-21 23:55:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 23:55:29,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:29,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:29,152 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-21 23:55:29,349 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-21 23:55:29,349 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 505961995, now seen corresponding path program 1 times [2022-07-21 23:55:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:29,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958812936] [2022-07-21 23:55:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:55:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:29,352 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-21 23:55:29,353 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-21 23:55:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:55:29,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:55:29,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:29,660 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-21 23:55:29,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:55:29,728 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-21 23:55:29,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:29,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958812936] [2022-07-21 23:55:29,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958812936] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:55:29,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:55:29,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 23:55:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971270699] [2022-07-21 23:55:29,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:55:29,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 23:55:29,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 23:55:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 23:55:29,733 INFO L87 Difference]: Start difference. First operand 1251 states and 1473 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:29,866 INFO L93 Difference]: Finished difference Result 1263 states and 1490 transitions. [2022-07-21 23:55:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 23:55:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-07-21 23:55:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:29,870 INFO L225 Difference]: With dead ends: 1263 [2022-07-21 23:55:29,871 INFO L226 Difference]: Without dead ends: 1263 [2022-07-21 23:55:29,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-21 23:55:29,871 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 15 mSDsluCounter, 4491 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5618 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:29,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5618 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 23:55:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-21 23:55:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1261. [2022-07-21 23:55:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 789 states have (on average 1.8288973384030418) internal successors, (1443), 1249 states have internal predecessors, (1443), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-21 23:55:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1488 transitions. [2022-07-21 23:55:29,889 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1488 transitions. Word has length 74 [2022-07-21 23:55:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:29,889 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1488 transitions. [2022-07-21 23:55:29,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1488 transitions. [2022-07-21 23:55:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 23:55:29,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:29,890 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:29,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-21 23:55:30,103 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-21 23:55:30,104 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 279993196, now seen corresponding path program 2 times [2022-07-21 23:55:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276578183] [2022-07-21 23:55:30,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 23:55:30,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:30,106 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-21 23:55:30,107 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-21 23:55:30,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 23:55:30,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:55:30,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 23:55:30,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:30,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:55:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:30,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:30,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276578183] [2022-07-21 23:55:30,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276578183] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:55:30,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:55:30,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-21 23:55:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555612106] [2022-07-21 23:55:30,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:55:30,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 23:55:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:30,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 23:55:30,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-21 23:55:30,818 INFO L87 Difference]: Start difference. First operand 1261 states and 1488 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:31,301 INFO L93 Difference]: Finished difference Result 1282 states and 1516 transitions. [2022-07-21 23:55:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 23:55:31,302 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-07-21 23:55:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:31,305 INFO L225 Difference]: With dead ends: 1282 [2022-07-21 23:55:31,305 INFO L226 Difference]: Without dead ends: 1278 [2022-07-21 23:55:31,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-21 23:55:31,306 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 62 mSDsluCounter, 5634 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 6764 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:31,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 6764 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 23:55:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-07-21 23:55:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1270. [2022-07-21 23:55:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 798 states have (on average 1.8233082706766917) internal successors, (1455), 1258 states have internal predecessors, (1455), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-21 23:55:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1500 transitions. [2022-07-21 23:55:31,323 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1500 transitions. Word has length 77 [2022-07-21 23:55:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:31,323 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1500 transitions. [2022-07-21 23:55:31,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1500 transitions. [2022-07-21 23:55:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-21 23:55:31,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:31,325 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:31,339 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-21 23:55:31,538 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-21 23:55:31,539 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash -183892212, now seen corresponding path program 3 times [2022-07-21 23:55:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:31,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178622788] [2022-07-21 23:55:31,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 23:55:31,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:31,541 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-21 23:55:31,542 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-21 23:55:32,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-21 23:55:32,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:55:32,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 23:55:32,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:32,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:55:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:32,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178622788] [2022-07-21 23:55:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178622788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:55:32,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:55:32,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-21 23:55:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745300597] [2022-07-21 23:55:32,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:55:32,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 23:55:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 23:55:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-21 23:55:32,951 INFO L87 Difference]: Start difference. First operand 1270 states and 1500 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:35,813 INFO L93 Difference]: Finished difference Result 1312 states and 1562 transitions. [2022-07-21 23:55:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 23:55:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-07-21 23:55:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:35,816 INFO L225 Difference]: With dead ends: 1312 [2022-07-21 23:55:35,817 INFO L226 Difference]: Without dead ends: 1306 [2022-07-21 23:55:35,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-21 23:55:35,818 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 181 mSDsluCounter, 13562 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 14697 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:35,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 14697 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 23:55:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-21 23:55:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1288. [2022-07-21 23:55:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 816 states have (on average 1.8112745098039216) internal successors, (1478), 1276 states have internal predecessors, (1478), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-21 23:55:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1523 transitions. [2022-07-21 23:55:35,836 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1523 transitions. Word has length 83 [2022-07-21 23:55:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:35,836 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1523 transitions. [2022-07-21 23:55:35,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1523 transitions. [2022-07-21 23:55:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 23:55:35,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:35,837 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:35,854 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-21 23:55:36,054 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-21 23:55:36,054 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 171030092, now seen corresponding path program 4 times [2022-07-21 23:55:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:36,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280831056] [2022-07-21 23:55:36,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 23:55:36,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:36,057 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-21 23:55:36,057 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-21 23:55:36,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 23:55:36,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:55:36,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 23:55:36,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:36,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:55:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:55:38,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280831056] [2022-07-21 23:55:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280831056] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:55:38,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:55:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-21 23:55:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878521641] [2022-07-21 23:55:38,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:55:38,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 23:55:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:55:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 23:55:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 23:55:38,271 INFO L87 Difference]: Start difference. First operand 1288 states and 1523 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:55:49,390 INFO L93 Difference]: Finished difference Result 1368 states and 1635 transitions. [2022-07-21 23:55:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-21 23:55:49,391 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-07-21 23:55:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:55:49,393 INFO L225 Difference]: With dead ends: 1368 [2022-07-21 23:55:49,394 INFO L226 Difference]: Without dead ends: 1364 [2022-07-21 23:55:49,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-21 23:55:49,397 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 369 mSDsluCounter, 27415 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 28562 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:55:49,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 28562 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 23:55:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-21 23:55:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1322. [2022-07-21 23:55:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 850 states have (on average 1.7929411764705883) internal successors, (1524), 1310 states have internal predecessors, (1524), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-21 23:55:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1569 transitions. [2022-07-21 23:55:49,417 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1569 transitions. Word has length 95 [2022-07-21 23:55:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:55:49,417 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1569 transitions. [2022-07-21 23:55:49,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:55:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1569 transitions. [2022-07-21 23:55:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 23:55:49,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:55:49,419 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:55:49,437 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-21 23:55:49,633 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-21 23:55:49,634 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:55:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:55:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422612, now seen corresponding path program 5 times [2022-07-21 23:55:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:55:49,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844372149] [2022-07-21 23:55:49,635 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 23:55:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:55:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:55:49,636 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-21 23:55:49,637 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-21 23:55:50,902 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-21 23:55:50,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:55:50,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 23:55:50,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:55:50,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:55:51,027 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:55:51,028 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-21 23:55:51,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:55:51,115 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 22 treesize of output 10 [2022-07-21 23:55:51,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927)))) is different from true [2022-07-21 23:55:52,429 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:55:52,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 23:55:52,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-21 23:55:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-07-21 23:55:52,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:55:52,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:55:52,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844372149] [2022-07-21 23:55:52,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844372149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 23:55:52,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [540827114] [2022-07-21 23:55:52,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 23:55:52,749 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 23:55:52,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 23:55:52,751 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 23:55:52,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-21 23:57:26,228 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-21 23:57:26,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:57:26,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-21 23:57:26,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:57:26,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:57:26,521 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:57:26,521 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-21 23:57:26,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:57:26,568 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 22 treesize of output 10 [2022-07-21 23:57:26,686 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-07-21 23:57:26,835 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:57:26,876 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381)))) is different from true [2022-07-21 23:57:27,001 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2022-07-21 23:57:27,014 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:57:27,198 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-07-21 23:57:27,502 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406)))) is different from true [2022-07-21 23:57:27,511 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407)))) is different from true [2022-07-21 23:57:27,706 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:57:27,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-21 23:57:27,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-21 23:57:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-07-21 23:57:27,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:57:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [540827114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 23:57:27,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:57:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 17 [2022-07-21 23:57:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050010564] [2022-07-21 23:57:27,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:57:27,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 23:57:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:57:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 23:57:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=103, Unknown=18, NotChecked=252, Total=420 [2022-07-21 23:57:27,946 INFO L87 Difference]: Start difference. First operand 1322 states and 1569 transitions. Second operand has 18 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:57:28,154 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2381))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-07-21 23:57:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:57:30,627 INFO L93 Difference]: Finished difference Result 1333 states and 1579 transitions. [2022-07-21 23:57:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 23:57:30,628 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-07-21 23:57:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:57:30,629 INFO L225 Difference]: With dead ends: 1333 [2022-07-21 23:57:30,629 INFO L226 Difference]: Without dead ends: 1329 [2022-07-21 23:57:30,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 138 SyntacticMatches, 84 SemanticMatches, 22 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=62, Invalid=139, Unknown=21, NotChecked=330, Total=552 [2022-07-21 23:57:30,630 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 758 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 3814 SdHoareTripleChecker+Invalid, 14360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12360 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 23:57:30,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 3814 Invalid, 14360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1992 Invalid, 0 Unknown, 12360 Unchecked, 2.5s Time] [2022-07-21 23:57:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-21 23:57:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-07-21 23:57:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 850 states have (on average 1.7870588235294118) internal successors, (1519), 1309 states have internal predecessors, (1519), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-21 23:57:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1564 transitions. [2022-07-21 23:57:30,646 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1564 transitions. Word has length 117 [2022-07-21 23:57:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:57:30,647 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1564 transitions. [2022-07-21 23:57:30,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:57:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1564 transitions. [2022-07-21 23:57:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 23:57:30,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:57:30,648 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:57:30,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-07-21 23:57:30,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-21 23:57:31,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:57:31,068 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-21 23:57:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:57:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422611, now seen corresponding path program 1 times [2022-07-21 23:57:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:57:31,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776587860] [2022-07-21 23:57:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:57:31,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:57:31,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:57:31,070 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-21 23:57:31,071 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-21 23:57:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:57:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-21 23:57:31,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:57:31,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:57:31,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:57:31,903 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:57:31,904 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-21 23:57:31,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:57:31,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 23:57:32,018 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 22 treesize of output 10 [2022-07-21 23:57:32,022 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 9 treesize of output 3 [2022-07-21 23:57:32,102 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2838))) (exists ((v_ArrVal_2839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2839))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-21 23:57:32,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-21 23:57:32,225 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 23:57:32,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-07-21 23:57:32,270 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-21 23:57:32,280 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 23:57:32,401 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871)))) is different from true [2022-07-21 23:57:32,410 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-21 23:57:32,470 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 23:57:32,479 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2881))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:57:32,527 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2886) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887)))) is different from true [2022-07-21 23:57:32,591 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2895) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894)))) is different from true [2022-07-21 23:57:32,600 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2896))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2897)))) is different from true [2022-07-21 23:57:32,609 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2898)))) is different from true [2022-07-21 23:57:32,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2902 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2902) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903)))) is different from true [2022-07-21 23:57:32,695 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:57:32,743 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2914) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 23:57:32,761 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916)))) is different from true [2022-07-21 23:57:32,770 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-21 23:57:32,779 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920)))) is different from true [2022-07-21 23:57:32,835 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:57:32,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-21 23:57:32,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 23:57:32,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-21 23:57:32,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 23:57:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-07-21 23:57:32,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:57:33,653 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3015) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1))))) is different from false [2022-07-21 23:57:33,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:57:33,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776587860] [2022-07-21 23:57:33,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776587860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 23:57:33,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [515320] [2022-07-21 23:57:33,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:57:33,659 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 23:57:33,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 23:57:33,660 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 23:57:33,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process