./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:51:05,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:51:05,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:51:05,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:51:05,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:51:05,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:51:05,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:51:05,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:51:05,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:51:05,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:51:05,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:51:05,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:51:05,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:51:05,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:51:05,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:51:05,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:51:05,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:51:05,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:51:05,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:51:05,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:51:05,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:51:05,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:51:05,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:51:05,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:51:05,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:51:05,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:51:05,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:51:05,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:51:05,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:51:05,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:51:05,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:51:05,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:51:05,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:51:05,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:51:05,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:51:05,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:51:05,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:51:05,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:51:05,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:51:05,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:51:05,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:51:05,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:51:05,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 12:51:05,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:51:05,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:51:05,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:51:05,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:51:05,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:51:05,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:51:05,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:51:05,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:51:05,779 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:51:05,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:51:05,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:51:05,780 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:51:05,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:51:05,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:51:05,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:51:05,780 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:51:05,781 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:51:05,781 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:51:05,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:51:05,782 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:51:05,782 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:51:05,782 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:51:05,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:51:05,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:51:05,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:51:05,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:51:05,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:51:05,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:51:05,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 12:51:05,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 12:51:05,784 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2022-07-14 12:51:05,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:51:06,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:51:06,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:51:06,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:51:06,020 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:51:06,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-14 12:51:06,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ba92c9e/506f0eb3241644e39f93dd9a04762cf9/FLAGe9b96ac4e [2022-07-14 12:51:06,644 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:51:06,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-14 12:51:06,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ba92c9e/506f0eb3241644e39f93dd9a04762cf9/FLAGe9b96ac4e [2022-07-14 12:51:06,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ba92c9e/506f0eb3241644e39f93dd9a04762cf9 [2022-07-14 12:51:06,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:51:06,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:51:06,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:06,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:51:06,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:51:06,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212a833e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06, skipping insertion in model container [2022-07-14 12:51:06,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:51:06,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:51:07,264 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_BER_test10-3.i[33022,33035] [2022-07-14 12:51:07,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:07,463 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 12:51:07,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44a55d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:07, skipping insertion in model container [2022-07-14 12:51:07,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:07,466 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 12:51:07,468 INFO L158 Benchmark]: Toolchain (without parser) took 545.10ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 46.9MB in the beginning and 78.9MB in the end (delta: -32.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-07-14 12:51:07,468 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 12:51:07,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.35ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 46.7MB in the beginning and 78.9MB in the end (delta: -32.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-07-14 12:51:07,471 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.35ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 46.7MB in the beginning and 78.9MB in the end (delta: -32.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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_BER_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:51:09,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:51:09,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:51:09,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:51:09,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:51:09,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:51:09,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:51:09,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:51:09,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:51:09,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:51:09,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:51:09,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:51:09,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:51:09,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:51:09,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:51:09,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:51:09,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:51:09,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:51:09,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:51:09,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:51:09,172 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:51:09,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:51:09,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:51:09,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:51:09,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:51:09,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:51:09,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:51:09,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:51:09,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:51:09,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:51:09,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:51:09,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:51:09,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:51:09,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:51:09,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:51:09,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:51:09,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:51:09,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:51:09,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:51:09,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:51:09,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:51:09,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:51:09,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 12:51:09,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:51:09,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:51:09,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:51:09,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:51:09,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:51:09,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:51:09,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:51:09,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:51:09,204 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:51:09,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:51:09,212 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:51:09,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:51:09,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:51:09,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:51:09,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:51:09,221 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:51:09,221 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:51:09,221 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:51:09,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:51:09,221 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:51:09,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:51:09,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:51:09,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:51:09,223 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 12:51:09,223 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 12:51:09,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 12:51:09,223 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2022-07-14 12:51:09,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:51:09,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:51:09,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:51:09,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:51:09,494 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:51:09,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-14 12:51:09,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49ef1fb7/db935d32174a4485ae84c24e11f8e593/FLAG17e84f7d0 [2022-07-14 12:51:10,015 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:51:10,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-14 12:51:10,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49ef1fb7/db935d32174a4485ae84c24e11f8e593/FLAG17e84f7d0 [2022-07-14 12:51:10,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49ef1fb7/db935d32174a4485ae84c24e11f8e593 [2022-07-14 12:51:10,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:51:10,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:51:10,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:10,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:51:10,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:51:10,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:10" (1/1) ... [2022-07-14 12:51:10,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efcb964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:10, skipping insertion in model container [2022-07-14 12:51:10,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:10" (1/1) ... [2022-07-14 12:51:10,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:51:10,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:51:10,649 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_BER_test10-3.i[33022,33035] [2022-07-14 12:51:10,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:10,838 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 12:51:10,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:51:10,888 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_BER_test10-3.i[33022,33035] [2022-07-14 12:51:10,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:10,997 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 12:51:11,011 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_BER_test10-3.i[33022,33035] [2022-07-14 12:51:11,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:11,121 INFO L208 MainTranslator]: Completed translation [2022-07-14 12:51:11,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11 WrapperNode [2022-07-14 12:51:11,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:11,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 12:51:11,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 12:51:11,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 12:51:11,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,257 INFO L137 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2491 [2022-07-14 12:51:11,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 12:51:11,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 12:51:11,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 12:51:11,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 12:51:11,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 12:51:11,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 12:51:11,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 12:51:11,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 12:51:11,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (1/1) ... [2022-07-14 12:51:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:51:11,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 12:51:11,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 12:51:11,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 12:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 12:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-07-14 12:51:11,438 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-07-14 12:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 12:51:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 12:51:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 12:51:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 12:51:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 12:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 12:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 12:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 12:51:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 12:51:11,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 12:51:11,763 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 12:51:11,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 12:51:11,767 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 12:51:17,477 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 12:51:17,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 12:51:17,491 INFO L299 CfgBuilder]: Removed 168 assume(true) statements. [2022-07-14 12:51:17,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:51:17 BoogieIcfgContainer [2022-07-14 12:51:17,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 12:51:17,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 12:51:17,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 12:51:17,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 12:51:17,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:51:10" (1/3) ... [2022-07-14 12:51:17,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785fede5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:51:17, skipping insertion in model container [2022-07-14 12:51:17,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:11" (2/3) ... [2022-07-14 12:51:17,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785fede5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:51:17, skipping insertion in model container [2022-07-14 12:51:17,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:51:17" (3/3) ... [2022-07-14 12:51:17,499 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-3.i [2022-07-14 12:51:17,508 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 12:51:17,509 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2022-07-14 12:51:17,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 12:51:17,565 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@35276c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@776a822a [2022-07-14 12:51:17,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2022-07-14 12:51:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 12:51:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 12:51:17,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:17,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 12:51:17,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-07-14 12:51:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:17,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467701635] [2022-07-14 12:51:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:17,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:17,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:17,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 12:51:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:17,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:17,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:17,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:17,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:17,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:17,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467701635] [2022-07-14 12:51:17,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467701635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:17,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:17,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035495882] [2022-07-14 12:51:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:17,938 INFO L87 Difference]: Start difference. First operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:20,757 INFO L93 Difference]: Finished difference Result 3281 states and 3483 transitions. [2022-07-14 12:51:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:20,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 12:51:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:20,796 INFO L225 Difference]: With dead ends: 3281 [2022-07-14 12:51:20,796 INFO L226 Difference]: Without dead ends: 3279 [2022-07-14 12:51:20,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:20,802 INFO L413 NwaCegarLoop]: 1665 mSDtfsCounter, 2318 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:20,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2328 Valid, 2230 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 12:51:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-07-14 12:51:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2579. [2022-07-14 12:51:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 1398 states have (on average 2.067238912732475) internal successors, (2890), 2563 states have internal predecessors, (2890), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:51:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 2922 transitions. [2022-07-14 12:51:20,970 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 2922 transitions. Word has length 3 [2022-07-14 12:51:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:20,971 INFO L495 AbstractCegarLoop]: Abstraction has 2579 states and 2922 transitions. [2022-07-14 12:51:20,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 2922 transitions. [2022-07-14 12:51:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 12:51:20,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:20,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 12:51:20,996 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-14 12:51:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:21,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-07-14 12:51:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:21,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493672092] [2022-07-14 12:51:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:21,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:21,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:21,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:21,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 12:51:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:21,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:21,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:21,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:21,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:21,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:21,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493672092] [2022-07-14 12:51:21,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493672092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:21,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:21,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432402986] [2022-07-14 12:51:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:21,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:21,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:21,409 INFO L87 Difference]: Start difference. First operand 2579 states and 2922 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:25,534 INFO L93 Difference]: Finished difference Result 3727 states and 4170 transitions. [2022-07-14 12:51:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:25,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 12:51:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:25,544 INFO L225 Difference]: With dead ends: 3727 [2022-07-14 12:51:25,544 INFO L226 Difference]: Without dead ends: 3727 [2022-07-14 12:51:25,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:25,546 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 1240 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:25,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 3433 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-14 12:51:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2022-07-14 12:51:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3028. [2022-07-14 12:51:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1845 states have (on average 2.0233062330623306) internal successors, (3733), 3009 states have internal predecessors, (3733), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-14 12:51:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3771 transitions. [2022-07-14 12:51:25,602 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3771 transitions. Word has length 3 [2022-07-14 12:51:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:25,602 INFO L495 AbstractCegarLoop]: Abstraction has 3028 states and 3771 transitions. [2022-07-14 12:51:25,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3771 transitions. [2022-07-14 12:51:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 12:51:25,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:25,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:25,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:25,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:25,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-07-14 12:51:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290760149] [2022-07-14 12:51:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:25,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:25,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:25,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:25,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 12:51:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:25,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 12:51:25,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:25,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:25,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:51:26,053 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-14 12:51:26,061 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:51:26,061 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-14 12:51:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:26,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:26,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:26,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290760149] [2022-07-14 12:51:26,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290760149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:26,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:26,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:26,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179068607] [2022-07-14 12:51:26,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:26,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:26,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:26,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:26,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:26,080 INFO L87 Difference]: Start difference. First operand 3028 states and 3771 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-14 12:51:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:34,003 INFO L93 Difference]: Finished difference Result 6006 states and 6937 transitions. [2022-07-14 12:51:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:34,003 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-14 12:51:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:34,016 INFO L225 Difference]: With dead ends: 6006 [2022-07-14 12:51:34,016 INFO L226 Difference]: Without dead ends: 6006 [2022-07-14 12:51:34,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-14 12:51:34,017 INFO L413 NwaCegarLoop]: 981 mSDtfsCounter, 3127 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:34,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 3162 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-07-14 12:51:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2022-07-14 12:51:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3747. [2022-07-14 12:51:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3747 states, 2564 states have (on average 2.0514820592823715) internal successors, (5260), 3722 states have internal predecessors, (5260), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 5310 transitions. [2022-07-14 12:51:34,074 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 5310 transitions. Word has length 7 [2022-07-14 12:51:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:34,075 INFO L495 AbstractCegarLoop]: Abstraction has 3747 states and 5310 transitions. [2022-07-14 12:51:34,075 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-14 12:51:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 5310 transitions. [2022-07-14 12:51:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 12:51:34,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:34,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:34,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-14 12:51:34,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:34,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-07-14 12:51:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:34,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432636569] [2022-07-14 12:51:34,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:34,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:34,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:34,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 12:51:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:34,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:34,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:34,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:34,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:34,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:34,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432636569] [2022-07-14 12:51:34,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432636569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:34,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:34,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232140184] [2022-07-14 12:51:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:34,488 INFO L87 Difference]: Start difference. First operand 3747 states and 5310 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-14 12:51:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:36,895 INFO L93 Difference]: Finished difference Result 4951 states and 6827 transitions. [2022-07-14 12:51:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:36,896 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-14 12:51:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:36,910 INFO L225 Difference]: With dead ends: 4951 [2022-07-14 12:51:36,913 INFO L226 Difference]: Without dead ends: 4951 [2022-07-14 12:51:36,914 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-14 12:51:36,917 INFO L413 NwaCegarLoop]: 2366 mSDtfsCounter, 1998 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:36,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 3212 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 12:51:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2022-07-14 12:51:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 3656. [2022-07-14 12:51:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2564 states have (on average 1.968408736349454) internal successors, (5047), 3631 states have internal predecessors, (5047), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5097 transitions. [2022-07-14 12:51:36,965 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5097 transitions. Word has length 8 [2022-07-14 12:51:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:36,965 INFO L495 AbstractCegarLoop]: Abstraction has 3656 states and 5097 transitions. [2022-07-14 12:51:36,965 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-14 12:51:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5097 transitions. [2022-07-14 12:51:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 12:51:36,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:36,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:36,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 12:51:37,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:37,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:37,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:37,176 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-07-14 12:51:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:37,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316458138] [2022-07-14 12:51:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:37,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:37,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 12:51:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:37,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:37,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:37,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:37,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:37,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316458138] [2022-07-14 12:51:37,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316458138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:37,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:37,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807559374] [2022-07-14 12:51:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:37,386 INFO L87 Difference]: Start difference. First operand 3656 states and 5097 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-14 12:51:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:41,145 INFO L93 Difference]: Finished difference Result 5371 states and 7455 transitions. [2022-07-14 12:51:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:41,145 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-14 12:51:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:41,160 INFO L225 Difference]: With dead ends: 5371 [2022-07-14 12:51:41,160 INFO L226 Difference]: Without dead ends: 5371 [2022-07-14 12:51:41,160 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-14 12:51:41,161 INFO L413 NwaCegarLoop]: 2746 mSDtfsCounter, 1369 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:41,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3931 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-14 12:51:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2022-07-14 12:51:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 3978. [2022-07-14 12:51:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 2896 states have (on average 1.9540745856353592) internal successors, (5659), 3953 states have internal predecessors, (5659), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5709 transitions. [2022-07-14 12:51:41,212 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5709 transitions. Word has length 8 [2022-07-14 12:51:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:41,212 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 5709 transitions. [2022-07-14 12:51:41,212 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-14 12:51:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5709 transitions. [2022-07-14 12:51:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 12:51:41,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:41,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:41,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-14 12:51:41,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:41,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2022-07-14 12:51:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:41,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50778192] [2022-07-14 12:51:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:41,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:41,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 12:51:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:41,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:51:41,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:41,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:41,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:41,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50778192] [2022-07-14 12:51:41,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50778192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:41,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:41,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824806649] [2022-07-14 12:51:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:41,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:41,632 INFO L87 Difference]: Start difference. First operand 3978 states and 5709 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-14 12:51:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:41,664 INFO L93 Difference]: Finished difference Result 3918 states and 5623 transitions. [2022-07-14 12:51:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:41,664 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-14 12:51:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:41,681 INFO L225 Difference]: With dead ends: 3918 [2022-07-14 12:51:41,681 INFO L226 Difference]: Without dead ends: 3918 [2022-07-14 12:51:41,682 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-14 12:51:41,683 INFO L413 NwaCegarLoop]: 2407 mSDtfsCounter, 1197 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3623 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-14 12:51:41,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3623 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2022-07-14 12:51:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 3918. [2022-07-14 12:51:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 2860 states have (on average 1.9486013986013986) internal successors, (5573), 3893 states have internal predecessors, (5573), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5623 transitions. [2022-07-14 12:51:41,728 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5623 transitions. Word has length 11 [2022-07-14 12:51:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:41,729 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 5623 transitions. [2022-07-14 12:51:41,729 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-14 12:51:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5623 transitions. [2022-07-14 12:51:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 12:51:41,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:41,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:41,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:41,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2022-07-14 12:51:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:41,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251160277] [2022-07-14 12:51:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:41,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:41,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:41,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 12:51:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:42,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:42,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:42,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:42,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:42,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251160277] [2022-07-14 12:51:42,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251160277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:42,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:42,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571310085] [2022-07-14 12:51:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:42,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:42,141 INFO L87 Difference]: Start difference. First operand 3918 states and 5623 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:42,209 INFO L93 Difference]: Finished difference Result 3890 states and 5567 transitions. [2022-07-14 12:51:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:42,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 12:51:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:42,219 INFO L225 Difference]: With dead ends: 3890 [2022-07-14 12:51:42,219 INFO L226 Difference]: Without dead ends: 3890 [2022-07-14 12:51:42,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:42,220 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 1168 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5933 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-14 12:51:42,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 5933 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2022-07-14 12:51:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2022-07-14 12:51:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 2844 states have (on average 1.939170182841069) internal successors, (5515), 3863 states have internal predecessors, (5515), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5565 transitions. [2022-07-14 12:51:42,278 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5565 transitions. Word has length 13 [2022-07-14 12:51:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:42,278 INFO L495 AbstractCegarLoop]: Abstraction has 3888 states and 5565 transitions. [2022-07-14 12:51:42,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5565 transitions. [2022-07-14 12:51:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 12:51:42,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:42,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:42,294 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-14 12:51:42,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:42,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-07-14 12:51:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:42,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340282982] [2022-07-14 12:51:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:42,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:42,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 12:51:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:51:42,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:42,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:42,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340282982] [2022-07-14 12:51:42,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340282982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:42,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:42,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548209941] [2022-07-14 12:51:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:42,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:42,694 INFO L87 Difference]: Start difference. First operand 3888 states and 5565 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:42,735 INFO L93 Difference]: Finished difference Result 5514 states and 7318 transitions. [2022-07-14 12:51:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 12:51:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:42,746 INFO L225 Difference]: With dead ends: 5514 [2022-07-14 12:51:42,746 INFO L226 Difference]: Without dead ends: 5514 [2022-07-14 12:51:42,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:42,747 INFO L413 NwaCegarLoop]: 4091 mSDtfsCounter, 2288 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 5893 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-14 12:51:42,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 5893 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2022-07-14 12:51:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 3828. [2022-07-14 12:51:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 2808 states have (on average 1.9334045584045585) internal successors, (5429), 3803 states have internal predecessors, (5429), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5479 transitions. [2022-07-14 12:51:42,790 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5479 transitions. Word has length 20 [2022-07-14 12:51:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:42,790 INFO L495 AbstractCegarLoop]: Abstraction has 3828 states and 5479 transitions. [2022-07-14 12:51:42,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5479 transitions. [2022-07-14 12:51:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 12:51:42,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:42,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:42,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:42,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:43,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2022-07-14 12:51:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:43,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888615789] [2022-07-14 12:51:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:43,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:43,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:43,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 12:51:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:43,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:51:43,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:43,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:43,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:43,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888615789] [2022-07-14 12:51:43,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888615789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:43,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:43,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128880444] [2022-07-14 12:51:43,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:43,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:43,202 INFO L87 Difference]: Start difference. First operand 3828 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:43,237 INFO L93 Difference]: Finished difference Result 5347 states and 7027 transitions. [2022-07-14 12:51:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:43,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 12:51:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:43,245 INFO L225 Difference]: With dead ends: 5347 [2022-07-14 12:51:43,245 INFO L226 Difference]: Without dead ends: 5347 [2022-07-14 12:51:43,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:43,247 INFO L413 NwaCegarLoop]: 3778 mSDtfsCounter, 2245 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 5532 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-14 12:51:43,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 5532 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2022-07-14 12:51:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 3696. [2022-07-14 12:51:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2700 states have (on average 1.915185185185185) internal successors, (5171), 3671 states have internal predecessors, (5171), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5221 transitions. [2022-07-14 12:51:43,299 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5221 transitions. Word has length 20 [2022-07-14 12:51:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:43,299 INFO L495 AbstractCegarLoop]: Abstraction has 3696 states and 5221 transitions. [2022-07-14 12:51:43,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5221 transitions. [2022-07-14 12:51:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 12:51:43,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:43,301 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] [2022-07-14 12:51:43,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:43,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:43,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-07-14 12:51:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:43,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032232496] [2022-07-14 12:51:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:43,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:43,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 12:51:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:43,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:43,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:43,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:43,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032232496] [2022-07-14 12:51:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032232496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:43,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967386384] [2022-07-14 12:51:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:43,750 INFO L87 Difference]: Start difference. First operand 3696 states and 5221 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:43,822 INFO L93 Difference]: Finished difference Result 5312 states and 6961 transitions. [2022-07-14 12:51:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-14 12:51:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:43,829 INFO L225 Difference]: With dead ends: 5312 [2022-07-14 12:51:43,829 INFO L226 Difference]: Without dead ends: 5312 [2022-07-14 12:51:43,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:43,830 INFO L413 NwaCegarLoop]: 3960 mSDtfsCounter, 2216 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 9672 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-14 12:51:43,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 9672 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2022-07-14 12:51:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3666. [2022-07-14 12:51:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2684 states have (on average 1.9049925484351713) internal successors, (5113), 3641 states have internal predecessors, (5113), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 5163 transitions. [2022-07-14 12:51:43,872 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 5163 transitions. Word has length 22 [2022-07-14 12:51:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:43,873 INFO L495 AbstractCegarLoop]: Abstraction has 3666 states and 5163 transitions. [2022-07-14 12:51:43,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 5163 transitions. [2022-07-14 12:51:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 12:51:43,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:43,876 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] [2022-07-14 12:51:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:44,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:44,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2022-07-14 12:51:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:44,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252371749] [2022-07-14 12:51:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:44,086 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:44,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 12:51:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:44,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:44,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:44,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:44,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252371749] [2022-07-14 12:51:44,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252371749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:44,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:44,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963919656] [2022-07-14 12:51:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:44,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:44,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:44,315 INFO L87 Difference]: Start difference. First operand 3666 states and 5163 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:44,382 INFO L93 Difference]: Finished difference Result 5239 states and 6772 transitions. [2022-07-14 12:51:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-14 12:51:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:44,389 INFO L225 Difference]: With dead ends: 5239 [2022-07-14 12:51:44,389 INFO L226 Difference]: Without dead ends: 5239 [2022-07-14 12:51:44,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:44,389 INFO L413 NwaCegarLoop]: 3885 mSDtfsCounter, 2181 mSDsluCounter, 5597 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 9482 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-14 12:51:44,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 9482 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2022-07-14 12:51:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 3604. [2022-07-14 12:51:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2636 states have (on average 1.8736722306525038) internal successors, (4939), 3579 states have internal predecessors, (4939), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4989 transitions. [2022-07-14 12:51:44,423 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4989 transitions. Word has length 22 [2022-07-14 12:51:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:44,423 INFO L495 AbstractCegarLoop]: Abstraction has 3604 states and 4989 transitions. [2022-07-14 12:51:44,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4989 transitions. [2022-07-14 12:51:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:51:44,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:44,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:44,433 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-14 12:51:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:44,633 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2022-07-14 12:51:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:44,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763533001] [2022-07-14 12:51:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:44,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:44,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 12:51:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:44,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:44,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:44,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:44,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:44,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:44,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763533001] [2022-07-14 12:51:44,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763533001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:44,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:44,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24192681] [2022-07-14 12:51:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:44,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:44,866 INFO L87 Difference]: Start difference. First operand 3604 states and 4989 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:47,813 INFO L93 Difference]: Finished difference Result 4225 states and 5525 transitions. [2022-07-14 12:51:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:51:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:47,819 INFO L225 Difference]: With dead ends: 4225 [2022-07-14 12:51:47,819 INFO L226 Difference]: Without dead ends: 4225 [2022-07-14 12:51:47,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:47,819 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 3097 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3103 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:47,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3103 Valid, 2793 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 12:51:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2022-07-14 12:51:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 3600. [2022-07-14 12:51:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2636 states have (on average 1.8706373292867982) internal successors, (4931), 3575 states have internal predecessors, (4931), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2022-07-14 12:51:47,866 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 27 [2022-07-14 12:51:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:47,866 INFO L495 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2022-07-14 12:51:47,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2022-07-14 12:51:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:51:47,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:47,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:47,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:48,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:48,074 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:48,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2022-07-14 12:51:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:48,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544894637] [2022-07-14 12:51:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:48,091 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:48,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 12:51:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:48,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:51:48,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:48,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:48,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:48,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:48,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544894637] [2022-07-14 12:51:48,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544894637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:48,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:48,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043167418] [2022-07-14 12:51:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:48,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:48,406 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:52,795 INFO L93 Difference]: Finished difference Result 4679 states and 6151 transitions. [2022-07-14 12:51:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:51:52,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:51:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:52,805 INFO L225 Difference]: With dead ends: 4679 [2022-07-14 12:51:52,805 INFO L226 Difference]: Without dead ends: 4679 [2022-07-14 12:51:52,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:52,806 INFO L413 NwaCegarLoop]: 1748 mSDtfsCounter, 2279 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:52,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 4099 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 12:51:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-07-14 12:51:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3636. [2022-07-14 12:51:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 2672 states have (on average 1.8607784431137724) internal successors, (4972), 3611 states have internal predecessors, (4972), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5022 transitions. [2022-07-14 12:51:52,862 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5022 transitions. Word has length 27 [2022-07-14 12:51:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:52,862 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 5022 transitions. [2022-07-14 12:51:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5022 transitions. [2022-07-14 12:51:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 12:51:52,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:52,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:52,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:53,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:53,073 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-07-14 12:51:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106641052] [2022-07-14 12:51:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:53,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:53,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:53,097 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:53,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 12:51:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:53,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:53,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:53,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:53,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:53,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:53,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106641052] [2022-07-14 12:51:53,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106641052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:53,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:53,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715381729] [2022-07-14 12:51:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:53,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:53,352 INFO L87 Difference]: Start difference. First operand 3636 states and 5022 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:57,429 INFO L93 Difference]: Finished difference Result 7033 states and 9556 transitions. [2022-07-14 12:51:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:51:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 12:51:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:57,454 INFO L225 Difference]: With dead ends: 7033 [2022-07-14 12:51:57,454 INFO L226 Difference]: Without dead ends: 7033 [2022-07-14 12:51:57,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:57,455 INFO L413 NwaCegarLoop]: 2580 mSDtfsCounter, 4500 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:57,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 4978 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-14 12:51:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2022-07-14 12:51:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3632. [2022-07-14 12:51:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2672 states have (on average 1.8577844311377245) internal successors, (4964), 3607 states have internal predecessors, (4964), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:51:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2022-07-14 12:51:57,489 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 36 [2022-07-14 12:51:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:57,489 INFO L495 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2022-07-14 12:51:57,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2022-07-14 12:51:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 12:51:57,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:57,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:57,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-14 12:51:57,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:57,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:51:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-07-14 12:51:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:57,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601752909] [2022-07-14 12:51:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:57,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:57,700 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:57,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 12:51:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:57,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:51:57,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:57,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:58,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:58,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601752909] [2022-07-14 12:51:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601752909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:58,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:58,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607622621] [2022-07-14 12:51:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:58,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:58,065 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:03,906 INFO L93 Difference]: Finished difference Result 6725 states and 8957 transitions. [2022-07-14 12:52:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:52:03,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 12:52:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:03,933 INFO L225 Difference]: With dead ends: 6725 [2022-07-14 12:52:03,944 INFO L226 Difference]: Without dead ends: 6725 [2022-07-14 12:52:03,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:03,945 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 3252 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3256 SdHoareTripleChecker+Valid, 5833 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:03,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3256 Valid, 5833 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-14 12:52:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2022-07-14 12:52:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 3628. [2022-07-14 12:52:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2672 states have (on average 1.8547904191616766) internal successors, (4956), 3603 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:52:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2022-07-14 12:52:03,987 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2022-07-14 12:52:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:03,988 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2022-07-14 12:52:03,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2022-07-14 12:52:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 12:52:03,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:03,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:52:04,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:04,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:04,212 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2022-07-14 12:52:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:04,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088671735] [2022-07-14 12:52:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:04,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:04,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:04,215 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:04,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 12:52:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:04,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:52:04,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:04,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:04,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:04,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088671735] [2022-07-14 12:52:04,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088671735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:04,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:04,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:52:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374226447] [2022-07-14 12:52:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:04,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:04,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:04,500 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:08,918 INFO L93 Difference]: Finished difference Result 7477 states and 10068 transitions. [2022-07-14 12:52:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:52:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 12:52:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:08,927 INFO L225 Difference]: With dead ends: 7477 [2022-07-14 12:52:08,927 INFO L226 Difference]: Without dead ends: 7477 [2022-07-14 12:52:08,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:08,928 INFO L413 NwaCegarLoop]: 2542 mSDtfsCounter, 4861 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4871 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:08,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4871 Valid, 5133 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 12:52:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-07-14 12:52:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 3625. [2022-07-14 12:52:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.846556886227545) internal successors, (4934), 3600 states have internal predecessors, (4934), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:52:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4984 transitions. [2022-07-14 12:52:09,017 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4984 transitions. Word has length 36 [2022-07-14 12:52:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:09,018 INFO L495 AbstractCegarLoop]: Abstraction has 3625 states and 4984 transitions. [2022-07-14 12:52:09,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4984 transitions. [2022-07-14 12:52:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 12:52:09,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:09,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:52:09,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-14 12:52:09,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:09,227 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2022-07-14 12:52:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:09,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542172456] [2022-07-14 12:52:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:09,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:09,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:09,236 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:09,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 12:52:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:09,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:52:09,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:09,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:09,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:09,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:09,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542172456] [2022-07-14 12:52:09,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542172456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:09,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:09,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:52:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688283460] [2022-07-14 12:52:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:09,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:09,525 INFO L87 Difference]: Start difference. First operand 3625 states and 4984 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:14,424 INFO L93 Difference]: Finished difference Result 5561 states and 7343 transitions. [2022-07-14 12:52:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:52:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 12:52:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:14,430 INFO L225 Difference]: With dead ends: 5561 [2022-07-14 12:52:14,430 INFO L226 Difference]: Without dead ends: 5561 [2022-07-14 12:52:14,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:14,430 INFO L413 NwaCegarLoop]: 2838 mSDtfsCounter, 2602 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:14,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 5307 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 12:52:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2022-07-14 12:52:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 3625. [2022-07-14 12:52:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.843562874251497) internal successors, (4926), 3600 states have internal predecessors, (4926), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:52:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4976 transitions. [2022-07-14 12:52:14,462 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4976 transitions. Word has length 36 [2022-07-14 12:52:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:14,463 INFO L495 AbstractCegarLoop]: Abstraction has 3625 states and 4976 transitions. [2022-07-14 12:52:14,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4976 transitions. [2022-07-14 12:52:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 12:52:14,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:14,463 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] [2022-07-14 12:52:14,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:14,671 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2022-07-14 12:52:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:14,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242707305] [2022-07-14 12:52:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:14,675 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:14,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 12:52:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:14,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:14,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:14,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:14,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242707305] [2022-07-14 12:52:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242707305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:14,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:14,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651608925] [2022-07-14 12:52:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:14,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:14,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:14,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:14,916 INFO L87 Difference]: Start difference. First operand 3625 states and 4976 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:14,961 INFO L93 Difference]: Finished difference Result 3613 states and 4952 transitions. [2022-07-14 12:52:14,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:52:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-07-14 12:52:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:14,964 INFO L225 Difference]: With dead ends: 3613 [2022-07-14 12:52:14,965 INFO L226 Difference]: Without dead ends: 3613 [2022-07-14 12:52:14,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:14,965 INFO L413 NwaCegarLoop]: 2193 mSDtfsCounter, 1152 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 5414 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-14 12:52:14,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 5414 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:52:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2022-07-14 12:52:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3613. [2022-07-14 12:52:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2660 states have (on average 1.8428571428571427) internal successors, (4902), 3588 states have internal predecessors, (4902), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 12:52:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 4952 transitions. [2022-07-14 12:52:14,989 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 4952 transitions. Word has length 40 [2022-07-14 12:52:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:14,989 INFO L495 AbstractCegarLoop]: Abstraction has 3613 states and 4952 transitions. [2022-07-14 12:52:14,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 4952 transitions. [2022-07-14 12:52:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 12:52:14,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:14,990 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] [2022-07-14 12:52:14,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:15,198 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2022-07-14 12:52:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:15,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054502235] [2022-07-14 12:52:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:15,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:15,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:15,200 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:15,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 12:52:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:15,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:15,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:15,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:15,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054502235] [2022-07-14 12:52:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054502235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:15,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:15,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:52:15,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117709361] [2022-07-14 12:52:15,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:15,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:52:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:52:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:15,496 INFO L87 Difference]: Start difference. First operand 3613 states and 4952 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:15,713 INFO L93 Difference]: Finished difference Result 5433 states and 7161 transitions. [2022-07-14 12:52:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:52:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-07-14 12:52:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:15,718 INFO L225 Difference]: With dead ends: 5433 [2022-07-14 12:52:15,718 INFO L226 Difference]: Without dead ends: 5433 [2022-07-14 12:52:15,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:15,719 INFO L413 NwaCegarLoop]: 2282 mSDtfsCounter, 1568 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:15,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 4321 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:52:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2022-07-14 12:52:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 4630. [2022-07-14 12:52:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 3670 states have (on average 1.8258855585831062) internal successors, (6701), 4595 states have internal predecessors, (6701), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-14 12:52:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 6771 transitions. [2022-07-14 12:52:15,753 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 6771 transitions. Word has length 48 [2022-07-14 12:52:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:15,753 INFO L495 AbstractCegarLoop]: Abstraction has 4630 states and 6771 transitions. [2022-07-14 12:52:15,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 6771 transitions. [2022-07-14 12:52:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 12:52:15,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:15,754 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] [2022-07-14 12:52:15,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:15,966 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2022-07-14 12:52:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:15,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571598840] [2022-07-14 12:52:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:15,988 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:16,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 12:52:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:16,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:16,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:16,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:16,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:16,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571598840] [2022-07-14 12:52:16,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571598840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:16,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:16,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372955238] [2022-07-14 12:52:16,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:16,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:16,254 INFO L87 Difference]: Start difference. First operand 4630 states and 6771 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:16,327 INFO L93 Difference]: Finished difference Result 5942 states and 8145 transitions. [2022-07-14 12:52:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:52:16,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-07-14 12:52:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:16,332 INFO L225 Difference]: With dead ends: 5942 [2022-07-14 12:52:16,332 INFO L226 Difference]: Without dead ends: 5942 [2022-07-14 12:52:16,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:16,334 INFO L413 NwaCegarLoop]: 3432 mSDtfsCounter, 2151 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 8347 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-14 12:52:16,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 8347 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:52:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2022-07-14 12:52:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 4588. [2022-07-14 12:52:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 3628 states have (on average 1.8277287761852261) internal successors, (6631), 4553 states have internal predecessors, (6631), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-14 12:52:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6701 transitions. [2022-07-14 12:52:16,371 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6701 transitions. Word has length 51 [2022-07-14 12:52:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:16,371 INFO L495 AbstractCegarLoop]: Abstraction has 4588 states and 6701 transitions. [2022-07-14 12:52:16,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6701 transitions. [2022-07-14 12:52:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 12:52:16,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:16,372 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] [2022-07-14 12:52:16,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:16,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:16,581 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-07-14 12:52:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:16,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868572283] [2022-07-14 12:52:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:16,583 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:16,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 12:52:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:16,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:16,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:16,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:16,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:16,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868572283] [2022-07-14 12:52:16,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868572283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:16,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:16,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021386950] [2022-07-14 12:52:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:16,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:16,874 INFO L87 Difference]: Start difference. First operand 4588 states and 6701 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:16,941 INFO L93 Difference]: Finished difference Result 5678 states and 7631 transitions. [2022-07-14 12:52:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:52:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-07-14 12:52:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:16,947 INFO L225 Difference]: With dead ends: 5678 [2022-07-14 12:52:16,947 INFO L226 Difference]: Without dead ends: 5678 [2022-07-14 12:52:16,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:16,948 INFO L413 NwaCegarLoop]: 3694 mSDtfsCounter, 2142 mSDsluCounter, 5226 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 8920 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-14 12:52:16,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 8920 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:52:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2022-07-14 12:52:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 4570. [2022-07-14 12:52:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 3610 states have (on average 1.8285318559556787) internal successors, (6601), 4535 states have internal predecessors, (6601), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-14 12:52:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6671 transitions. [2022-07-14 12:52:16,985 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6671 transitions. Word has length 54 [2022-07-14 12:52:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:16,985 INFO L495 AbstractCegarLoop]: Abstraction has 4570 states and 6671 transitions. [2022-07-14 12:52:16,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6671 transitions. [2022-07-14 12:52:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 12:52:16,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:16,986 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] [2022-07-14 12:52:16,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:17,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:17,194 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -345082942, now seen corresponding path program 1 times [2022-07-14 12:52:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247656849] [2022-07-14 12:52:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:17,205 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:17,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 12:52:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:17,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:52:17,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:17,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 12:52:17,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 12:52:17,508 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-14 12:52:17,508 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 29 treesize of output 36 [2022-07-14 12:52:17,555 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-14 12:52:17,555 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 60 treesize of output 20 [2022-07-14 12:52:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:17,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:17,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:17,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247656849] [2022-07-14 12:52:17,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247656849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:17,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:17,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209898716] [2022-07-14 12:52:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:17,587 INFO L87 Difference]: Start difference. First operand 4570 states and 6671 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:18,825 INFO L93 Difference]: Finished difference Result 4797 states and 6909 transitions. [2022-07-14 12:52:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:52:18,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-14 12:52:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:18,831 INFO L225 Difference]: With dead ends: 4797 [2022-07-14 12:52:18,832 INFO L226 Difference]: Without dead ends: 4797 [2022-07-14 12:52:18,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:18,833 INFO L413 NwaCegarLoop]: 2071 mSDtfsCounter, 1031 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:18,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 5369 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 132 Unchecked, 1.2s Time] [2022-07-14 12:52:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2022-07-14 12:52:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4536. [2022-07-14 12:52:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3576 states have (on average 1.8361297539149888) internal successors, (6566), 4501 states have internal predecessors, (6566), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-14 12:52:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6636 transitions. [2022-07-14 12:52:18,867 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6636 transitions. Word has length 57 [2022-07-14 12:52:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:18,867 INFO L495 AbstractCegarLoop]: Abstraction has 4536 states and 6636 transitions. [2022-07-14 12:52:18,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6636 transitions. [2022-07-14 12:52:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 12:52:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:18,868 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] [2022-07-14 12:52:18,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:19,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:19,076 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2022-07-14 12:52:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:19,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138979947] [2022-07-14 12:52:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:19,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:19,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:19,079 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:19,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 12:52:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:19,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:19,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:19,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-14 12:52:19,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:19,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:19,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138979947] [2022-07-14 12:52:19,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138979947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:19,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:19,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:52:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041279349] [2022-07-14 12:52:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:19,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:52:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:52:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:19,502 INFO L87 Difference]: Start difference. First operand 4536 states and 6636 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:19,629 INFO L93 Difference]: Finished difference Result 6338 states and 8912 transitions. [2022-07-14 12:52:19,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:52:19,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-14 12:52:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:19,638 INFO L225 Difference]: With dead ends: 6338 [2022-07-14 12:52:19,639 INFO L226 Difference]: Without dead ends: 6338 [2022-07-14 12:52:19,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:19,639 INFO L413 NwaCegarLoop]: 2414 mSDtfsCounter, 1265 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:19,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 4482 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:52:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-07-14 12:52:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5609. [2022-07-14 12:52:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 4641 states have (on average 1.810385692738634) internal successors, (8402), 5563 states have internal predecessors, (8402), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-14 12:52:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 8494 transitions. [2022-07-14 12:52:19,686 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 8494 transitions. Word has length 59 [2022-07-14 12:52:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:19,687 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 8494 transitions. [2022-07-14 12:52:19,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 8494 transitions. [2022-07-14 12:52:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 12:52:19,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:19,688 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] [2022-07-14 12:52:19,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:19,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:19,896 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-07-14 12:52:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:19,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791252158] [2022-07-14 12:52:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:19,903 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:19,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 12:52:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:20,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 12:52:20,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:20,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:20,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:20,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:52:20,660 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-14 12:52:20,666 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:52:20,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 12:52:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:20,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:20,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:20,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791252158] [2022-07-14 12:52:20,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791252158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:20,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:20,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:52:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686788076] [2022-07-14 12:52:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:20,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:20,678 INFO L87 Difference]: Start difference. First operand 5609 states and 8494 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:24,172 INFO L93 Difference]: Finished difference Result 8028 states and 12217 transitions. [2022-07-14 12:52:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:52:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-14 12:52:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:24,182 INFO L225 Difference]: With dead ends: 8028 [2022-07-14 12:52:24,182 INFO L226 Difference]: Without dead ends: 8028 [2022-07-14 12:52:24,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-14 12:52:24,183 INFO L413 NwaCegarLoop]: 1039 mSDtfsCounter, 2474 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:24,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 1766 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-14 12:52:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8028 states. [2022-07-14 12:52:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8028 to 5369. [2022-07-14 12:52:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 4485 states have (on average 1.7438127090301003) internal successors, (7821), 5323 states have internal predecessors, (7821), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-14 12:52:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7913 transitions. [2022-07-14 12:52:24,252 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7913 transitions. Word has length 62 [2022-07-14 12:52:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:24,253 INFO L495 AbstractCegarLoop]: Abstraction has 5369 states and 7913 transitions. [2022-07-14 12:52:24,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7913 transitions. [2022-07-14 12:52:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:52:24,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:24,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:52:24,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:24,475 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-07-14 12:52:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:24,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895852964] [2022-07-14 12:52:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:24,484 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:24,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 12:52:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:24,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:52:24,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:24,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:24,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:52:24,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:52:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:24,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:24,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:24,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895852964] [2022-07-14 12:52:24,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895852964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:24,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:24,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056540713] [2022-07-14 12:52:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:24,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:52:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:52:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:24,813 INFO L87 Difference]: Start difference. First operand 5369 states and 7913 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:27,977 INFO L93 Difference]: Finished difference Result 5368 states and 7910 transitions. [2022-07-14 12:52:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:52:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-14 12:52:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:27,983 INFO L225 Difference]: With dead ends: 5368 [2022-07-14 12:52:27,983 INFO L226 Difference]: Without dead ends: 5368 [2022-07-14 12:52:27,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:52:27,983 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 4 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5570 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:27,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5570 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 12:52:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-07-14 12:52:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2022-07-14 12:52:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4485 states have (on average 1.7431438127090302) internal successors, (7818), 5322 states have internal predecessors, (7818), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-14 12:52:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7910 transitions. [2022-07-14 12:52:28,018 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7910 transitions. Word has length 67 [2022-07-14 12:52:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 5368 states and 7910 transitions. [2022-07-14 12:52:28,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7910 transitions. [2022-07-14 12:52:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:52:28,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:28,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:52:28,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:28,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:28,231 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-07-14 12:52:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:28,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543152631] [2022-07-14 12:52:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:28,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:28,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:28,234 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:28,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 12:52:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:28,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 12:52:28,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:28,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:28,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:52:28,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:52:28,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:52:28,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 12:52:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:28,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:28,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:28,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543152631] [2022-07-14 12:52:28,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543152631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:28,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:28,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603247276] [2022-07-14 12:52:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:52:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:52:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:28,597 INFO L87 Difference]: Start difference. First operand 5368 states and 7910 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:32,743 INFO L93 Difference]: Finished difference Result 5367 states and 7907 transitions. [2022-07-14 12:52:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:52:32,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-14 12:52:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:32,750 INFO L225 Difference]: With dead ends: 5367 [2022-07-14 12:52:32,751 INFO L226 Difference]: Without dead ends: 5367 [2022-07-14 12:52:32,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:52:32,751 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 2 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5571 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:32,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5571 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 12:52:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-07-14 12:52:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5367. [2022-07-14 12:52:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5367 states, 4482 states have (on average 1.7436412315930387) internal successors, (7815), 5321 states have internal predecessors, (7815), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-14 12:52:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 7907 transitions. [2022-07-14 12:52:32,835 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 7907 transitions. Word has length 67 [2022-07-14 12:52:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:32,835 INFO L495 AbstractCegarLoop]: Abstraction has 5367 states and 7907 transitions. [2022-07-14 12:52:32,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 7907 transitions. [2022-07-14 12:52:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:52:32,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:32,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:52:32,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-14 12:52:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:33,052 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2022-07-14 12:52:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534774253] [2022-07-14 12:52:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:33,064 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:33,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 12:52:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:33,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:52:33,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:33,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:33,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:52:33,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:52:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:33,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:33,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:33,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534774253] [2022-07-14 12:52:33,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534774253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:33,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:33,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474833726] [2022-07-14 12:52:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:33,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:52:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:52:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:33,394 INFO L87 Difference]: Start difference. First operand 5367 states and 7907 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:36,562 INFO L93 Difference]: Finished difference Result 5366 states and 7903 transitions. [2022-07-14 12:52:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:52:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-14 12:52:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:36,567 INFO L225 Difference]: With dead ends: 5366 [2022-07-14 12:52:36,567 INFO L226 Difference]: Without dead ends: 5366 [2022-07-14 12:52:36,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:52:36,568 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 4 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:36,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5565 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 12:52:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2022-07-14 12:52:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5366. [2022-07-14 12:52:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5366 states, 4482 states have (on average 1.7427487728692548) internal successors, (7811), 5320 states have internal predecessors, (7811), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-14 12:52:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5366 states to 5366 states and 7903 transitions. [2022-07-14 12:52:36,624 INFO L78 Accepts]: Start accepts. Automaton has 5366 states and 7903 transitions. Word has length 67 [2022-07-14 12:52:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:36,624 INFO L495 AbstractCegarLoop]: Abstraction has 5366 states and 7903 transitions. [2022-07-14 12:52:36,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5366 states and 7903 transitions. [2022-07-14 12:52:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:52:36,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:36,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:52:36,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:36,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:36,833 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:36,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2022-07-14 12:52:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:36,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008295250] [2022-07-14 12:52:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:36,835 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:36,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 12:52:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:37,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 12:52:37,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:37,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:52:37,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:52:37,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:52:37,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:52:37,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 12:52:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:37,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:37,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:37,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008295250] [2022-07-14 12:52:37,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008295250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:37,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:37,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403031861] [2022-07-14 12:52:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:37,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:52:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:37,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:52:37,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:37,213 INFO L87 Difference]: Start difference. First operand 5366 states and 7903 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:41,561 INFO L93 Difference]: Finished difference Result 5365 states and 7899 transitions. [2022-07-14 12:52:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:52:41,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-14 12:52:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:41,567 INFO L225 Difference]: With dead ends: 5365 [2022-07-14 12:52:41,567 INFO L226 Difference]: Without dead ends: 5365 [2022-07-14 12:52:41,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:52:41,567 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 2 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:41,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5566 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 12:52:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2022-07-14 12:52:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 5365. [2022-07-14 12:52:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4478 states have (on average 1.7434122376060741) internal successors, (7807), 5319 states have internal predecessors, (7807), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-14 12:52:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 7899 transitions. [2022-07-14 12:52:41,606 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 7899 transitions. Word has length 67 [2022-07-14 12:52:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:41,606 INFO L495 AbstractCegarLoop]: Abstraction has 5365 states and 7899 transitions. [2022-07-14 12:52:41,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 7899 transitions. [2022-07-14 12:52:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-14 12:52:41,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:41,608 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, 1] [2022-07-14 12:52:41,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-14 12:52:41,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:41,815 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1243544783, now seen corresponding path program 1 times [2022-07-14 12:52:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:41,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017179895] [2022-07-14 12:52:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:41,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:41,818 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:41,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-14 12:52:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:42,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:42,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:42,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:42,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:42,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017179895] [2022-07-14 12:52:42,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017179895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:42,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:42,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:52:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162459072] [2022-07-14 12:52:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:42,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:52:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:52:42,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:52:42,140 INFO L87 Difference]: Start difference. First operand 5365 states and 7899 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-14 12:52:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:42,205 INFO L93 Difference]: Finished difference Result 5368 states and 7908 transitions. [2022-07-14 12:52:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:52:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-07-14 12:52:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:42,214 INFO L225 Difference]: With dead ends: 5368 [2022-07-14 12:52:42,214 INFO L226 Difference]: Without dead ends: 5368 [2022-07-14 12:52:42,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:52:42,215 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 2 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6319 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6319 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:52:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-07-14 12:52:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2022-07-14 12:52:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4480 states have (on average 1.7433035714285714) internal successors, (7810), 5322 states have internal predecessors, (7810), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-14 12:52:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7908 transitions. [2022-07-14 12:52:42,261 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7908 transitions. Word has length 75 [2022-07-14 12:52:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:42,261 INFO L495 AbstractCegarLoop]: Abstraction has 5368 states and 7908 transitions. [2022-07-14 12:52:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-14 12:52:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7908 transitions. [2022-07-14 12:52:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 12:52:42,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:42,262 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, 1, 1] [2022-07-14 12:52:42,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:42,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:42,471 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1194961360, now seen corresponding path program 1 times [2022-07-14 12:52:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523105156] [2022-07-14 12:52:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:42,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:42,473 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:42,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 12:52:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:42,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:52:42,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:42,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:52:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:52:42,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:42,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523105156] [2022-07-14 12:52:42,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523105156] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:52:42,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:52:42,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 12:52:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077991077] [2022-07-14 12:52:42,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:52:42,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 12:52:42,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 12:52:42,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 12:52:42,887 INFO L87 Difference]: Start difference. First operand 5368 states and 7908 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-14 12:52:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:43,070 INFO L93 Difference]: Finished difference Result 5380 states and 7930 transitions. [2022-07-14 12:52:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 12:52:43,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-14 12:52:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:43,083 INFO L225 Difference]: With dead ends: 5380 [2022-07-14 12:52:43,083 INFO L226 Difference]: Without dead ends: 5380 [2022-07-14 12:52:43,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 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-14 12:52:43,084 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 12 mSDsluCounter, 12611 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14720 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:43,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14720 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:52:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2022-07-14 12:52:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5378. [2022-07-14 12:52:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5378 states, 4489 states have (on average 1.7431499220316329) internal successors, (7825), 5331 states have internal predecessors, (7825), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-14 12:52:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 7923 transitions. [2022-07-14 12:52:43,130 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 7923 transitions. Word has length 76 [2022-07-14 12:52:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:43,131 INFO L495 AbstractCegarLoop]: Abstraction has 5378 states and 7923 transitions. [2022-07-14 12:52:43,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-14 12:52:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 7923 transitions. [2022-07-14 12:52:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 12:52:43,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:43,132 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, 1, 1] [2022-07-14 12:52:43,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:43,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:43,342 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1708838159, now seen corresponding path program 2 times [2022-07-14 12:52:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:43,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237499917] [2022-07-14 12:52:43,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 12:52:43,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:43,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:43,345 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:43,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 12:52:43,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 12:52:43,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:52:43,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:52:43,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:43,975 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-14 12:52:43,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:52:44,100 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-14 12:52:44,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:44,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237499917] [2022-07-14 12:52:44,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237499917] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:52:44,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:52:44,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-14 12:52:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876046606] [2022-07-14 12:52:44,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:52:44,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 12:52:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 12:52:44,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 12:52:44,102 INFO L87 Difference]: Start difference. First operand 5378 states and 7923 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-14 12:52:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:44,675 INFO L93 Difference]: Finished difference Result 5399 states and 7971 transitions. [2022-07-14 12:52:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 12:52:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2022-07-14 12:52:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:44,683 INFO L225 Difference]: With dead ends: 5399 [2022-07-14 12:52:44,684 INFO L226 Difference]: Without dead ends: 5395 [2022-07-14 12:52:44,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-14 12:52:44,684 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 56 mSDsluCounter, 16839 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18951 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:44,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18951 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 12:52:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2022-07-14 12:52:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 5387. [2022-07-14 12:52:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 4498 states have (on average 1.7423299244108492) internal successors, (7837), 5340 states have internal predecessors, (7837), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-14 12:52:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7935 transitions. [2022-07-14 12:52:44,724 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7935 transitions. Word has length 79 [2022-07-14 12:52:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:44,725 INFO L495 AbstractCegarLoop]: Abstraction has 5387 states and 7935 transitions. [2022-07-14 12:52:44,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-14 12:52:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7935 transitions. [2022-07-14 12:52:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-14 12:52:44,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:44,726 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, 1, 1] [2022-07-14 12:52:44,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-14 12:52:44,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:44,938 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1472099985, now seen corresponding path program 3 times [2022-07-14 12:52:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:44,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962245425] [2022-07-14 12:52:44,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 12:52:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:44,940 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:44,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-14 12:52:45,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 12:52:45,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:52:45,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 12:52:45,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:45,766 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-14 12:52:45,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:52:46,292 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-14 12:52:46,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962245425] [2022-07-14 12:52:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962245425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:52:46,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:52:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-14 12:52:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036513398] [2022-07-14 12:52:46,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:52:46,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 12:52:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 12:52:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 12:52:46,294 INFO L87 Difference]: Start difference. First operand 5387 states and 7935 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-14 12:52:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:49,031 INFO L93 Difference]: Finished difference Result 5429 states and 8072 transitions. [2022-07-14 12:52:49,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 12:52:49,033 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2022-07-14 12:52:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:49,050 INFO L225 Difference]: With dead ends: 5429 [2022-07-14 12:52:49,050 INFO L226 Difference]: Without dead ends: 5423 [2022-07-14 12:52:49,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 12:52:49,052 INFO L413 NwaCegarLoop]: 2116 mSDtfsCounter, 189 mSDsluCounter, 23219 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 25335 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:49,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 25335 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 12:52:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2022-07-14 12:52:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 5405. [2022-07-14 12:52:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 4516 states have (on average 1.7404782993799823) internal successors, (7860), 5358 states have internal predecessors, (7860), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-14 12:52:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7958 transitions. [2022-07-14 12:52:49,125 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7958 transitions. Word has length 85 [2022-07-14 12:52:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:49,125 INFO L495 AbstractCegarLoop]: Abstraction has 5405 states and 7958 transitions. [2022-07-14 12:52:49,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-14 12:52:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7958 transitions. [2022-07-14 12:52:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-14 12:52:49,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:49,129 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, 1, 1] [2022-07-14 12:52:49,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-14 12:52:49,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:52:49,343 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:52:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1934666287, now seen corresponding path program 4 times [2022-07-14 12:52:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:49,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423621946] [2022-07-14 12:52:49,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 12:52:49,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:49,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:49,345 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:52:49,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-14 12:52:49,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 12:52:49,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:52:49,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 12:52:49,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:50,028 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-14 12:52:50,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:52:51,316 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-14 12:52:51,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:51,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423621946] [2022-07-14 12:52:51,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423621946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:52:51,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:52:51,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-14 12:52:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079150303] [2022-07-14 12:52:51,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:52:51,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 12:52:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:51,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 12:52:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 12:52:51,318 INFO L87 Difference]: Start difference. First operand 5405 states and 7958 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-14 12:53:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:01,843 INFO L93 Difference]: Finished difference Result 5485 states and 8175 transitions. [2022-07-14 12:53:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-14 12:53:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2022-07-14 12:53:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:01,853 INFO L225 Difference]: With dead ends: 5485 [2022-07-14 12:53:01,853 INFO L226 Difference]: Without dead ends: 5481 [2022-07-14 12:53:01,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-14 12:53:01,856 INFO L413 NwaCegarLoop]: 2129 mSDtfsCounter, 406 mSDsluCounter, 48856 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 50985 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:01,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 50985 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 12:53:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2022-07-14 12:53:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5439. [2022-07-14 12:53:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 4550 states have (on average 1.7375824175824175) internal successors, (7906), 5392 states have internal predecessors, (7906), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-14 12:53:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 8004 transitions. [2022-07-14 12:53:01,904 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 8004 transitions. Word has length 97 [2022-07-14 12:53:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:01,905 INFO L495 AbstractCegarLoop]: Abstraction has 5439 states and 8004 transitions. [2022-07-14 12:53:01,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-14 12:53:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 8004 transitions. [2022-07-14 12:53:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-14 12:53:01,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:01,907 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, 1, 1] [2022-07-14 12:53:01,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:02,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:02,120 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:53:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1997795441, now seen corresponding path program 5 times [2022-07-14 12:53:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:02,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718441479] [2022-07-14 12:53:02,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:53:02,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:02,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:02,125 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:02,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-14 12:53:03,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:53:03,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:03,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-14 12:53:03,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:03,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:03,690 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 12:53:03,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 12:53:03,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:03,775 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-14 12:53:04,727 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:53:04,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 12:53:04,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 12:53:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-14 12:53:04,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:04,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-14 12:53:04,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718441479] [2022-07-14 12:53:04,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718441479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:53:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1127204235] [2022-07-14 12:53:04,928 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:53:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:53:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:53:04,930 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:53:04,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-14 12:54:30,945 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:54:30,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:54:31,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 12:54:31,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:54:31,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:54:31,300 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 12:54:31,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 12:54:31,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:54:31,376 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-14 12:54:32,351 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:54:32,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 12:54:32,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 12:54:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-14 12:54:32,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:54:32,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1127204235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:54:32,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:54:32,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-14 12:54:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300789801] [2022-07-14 12:54:32,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:54:32,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 12:54:32,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:54:32,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 12:54:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=93, Unknown=12, NotChecked=20, Total=156 [2022-07-14 12:54:32,563 INFO L87 Difference]: Start difference. First operand 5439 states and 8004 transitions. Second operand has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 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-14 12:54:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:54:37,275 INFO L93 Difference]: Finished difference Result 7994 states and 12060 transitions. [2022-07-14 12:54:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 12:54:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 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 119 [2022-07-14 12:54:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:54:37,305 INFO L225 Difference]: With dead ends: 7994 [2022-07-14 12:54:37,305 INFO L226 Difference]: Without dead ends: 7990 [2022-07-14 12:54:37,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 140 SyntacticMatches, 93 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=44, Invalid=128, Unknown=14, NotChecked=24, Total=210 [2022-07-14 12:54:37,306 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 1592 mSDsluCounter, 6460 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 7829 SdHoareTripleChecker+Invalid, 8322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4779 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 12:54:37,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 7829 Invalid, 8322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3531 Invalid, 0 Unknown, 4779 Unchecked, 4.6s Time] [2022-07-14 12:54:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7990 states. [2022-07-14 12:54:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7990 to 5487. [2022-07-14 12:54:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5487 states, 4598 states have (on average 1.729447585906916) internal successors, (7952), 5439 states have internal predecessors, (7952), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-14 12:54:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8050 transitions. [2022-07-14 12:54:37,400 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 8050 transitions. Word has length 119 [2022-07-14 12:54:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:54:37,400 INFO L495 AbstractCegarLoop]: Abstraction has 5487 states and 8050 transitions. [2022-07-14 12:54:37,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 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-14 12:54:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 8050 transitions. [2022-07-14 12:54:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-14 12:54:37,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:54:37,402 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, 1, 1] [2022-07-14 12:54:37,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-14 12:54:37,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-14 12:54:37,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:54:37,819 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-14 12:54:37,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:54:37,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1997795440, now seen corresponding path program 1 times [2022-07-14 12:54:37,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:54:37,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050695066] [2022-07-14 12:54:37,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:54:37,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:54:37,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:54:37,821 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:54:37,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-14 12:54:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:54:38,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-14 12:54:38,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:54:38,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:54:38,754 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:54:38,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 12:54:38,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:54:38,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:54:38,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:54:38,839 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-14 12:54:38,842 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-14 12:54:38,877 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-14 12:54:38,884 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553)))) is different from true [2022-07-14 12:54:38,915 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-14 12:54:38,922 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560)))) is different from true [2022-07-14 12:54:38,954 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-14 12:54:38,961 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563)))) is different from true [2022-07-14 12:54:38,969 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-14 12:54:38,989 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568)))) is different from true [2022-07-14 12:54:39,000 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570)))) is different from true [2022-07-14 12:54:39,008 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571)))) is different from true [2022-07-14 12:54:39,015 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,053 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,080 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:54:39,087 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-07-14 12:54:39,095 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586)))) is different from true [2022-07-14 12:54:39,121 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590)))) is different from true [2022-07-14 12:54:39,128 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-07-14 12:54:39,137 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,145 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,152 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:54:39,160 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600)))) is different from true [2022-07-14 12:54:39,167 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602))) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-14 12:54:39,174 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,182 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2022-07-14 12:54:39,189 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:54:39,197 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610)))) is different from true [2022-07-14 12:54:39,204 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,211 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613))) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,239 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617)))) is different from true [2022-07-14 12:54:39,270 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-07-14 12:54:39,278 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624)))) is different from true [2022-07-14 12:54:39,286 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625)))) is different from true [2022-07-14 12:54:39,316 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628)))) is different from true [2022-07-14 12:54:39,334 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3630) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3629)))) is different from true [2022-07-14 12:54:39,342 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:54:39,349 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3633))) (exists ((v_ArrVal_3634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3634)))) is different from true [2022-07-14 12:54:39,355 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636)))) is different from true [2022-07-14 12:54:39,363 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637)))) is different from true [2022-07-14 12:54:39,386 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:54:39,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 12:54:39,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 12:54:39,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 12:54:39,431 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-14 12:54:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 969 not checked. [2022-07-14 12:54:39,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:54:40,103 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-14 12:54:40,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:54:40,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050695066] [2022-07-14 12:54:40,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050695066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:54:40,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1718367072] [2022-07-14 12:54:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:54:40,109 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:54:40,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:54:40,110 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:54:40,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process