./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/forester-heap/dll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:12:52,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:12:52,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:12:52,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:12:52,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:12:52,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:12:52,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:12:52,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:12:52,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:12:52,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:12:52,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:12:52,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:12:52,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:12:52,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:12:52,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:12:52,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:12:52,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:12:52,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:12:52,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:12:52,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:12:52,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:12:52,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:12:52,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:12:52,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:12:52,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:12:52,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:12:52,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:12:52,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:12:52,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:12:52,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:12:52,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:12:52,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:12:52,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:12:52,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:12:52,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:12:52,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:12:52,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:12:52,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:12:52,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:12:52,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:12:52,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:12:52,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:12:52,927 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:12:52,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:12:52,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:12:52,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:12:52,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:12:52,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:12:52,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:12:52,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:12:52,929 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:12:52,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:12:52,930 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:12:52,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:12:52,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:12:52,932 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:12:52,932 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:12:52,932 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:12:52,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:12:52,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:12:52,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:12:52,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:12:52,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:12:52,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:12:52,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:12:52,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:12:52,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:12:52,934 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:12:52,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:12:52,934 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:12:52,934 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2023-02-15 13:12:53,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:12:53,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:12:53,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:12:53,163 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:12:53,163 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:12:53,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2023-02-15 13:12:54,174 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:12:54,389 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:12:54,389 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2023-02-15 13:12:54,403 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7a3794e/691c4eeea54e41bdbfb68815720a8543/FLAG6cfdb7585 [2023-02-15 13:12:54,417 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7a3794e/691c4eeea54e41bdbfb68815720a8543 [2023-02-15 13:12:54,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:12:54,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:12:54,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:12:54,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:12:54,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:12:54,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696ad726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54, skipping insertion in model container [2023-02-15 13:12:54,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:12:54,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:12:54,694 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2023-02-15 13:12:54,705 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2023-02-15 13:12:54,708 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2023-02-15 13:12:54,709 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2023-02-15 13:12:54,713 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2023-02-15 13:12:54,715 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2023-02-15 13:12:54,717 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2023-02-15 13:12:54,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2023-02-15 13:12:54,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2023-02-15 13:12:54,721 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2023-02-15 13:12:54,723 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2023-02-15 13:12:54,723 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2023-02-15 13:12:54,724 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2023-02-15 13:12:54,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:12:54,739 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:12:54,763 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2023-02-15 13:12:54,774 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2023-02-15 13:12:54,776 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2023-02-15 13:12:54,776 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2023-02-15 13:12:54,790 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2023-02-15 13:12:54,790 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2023-02-15 13:12:54,791 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2023-02-15 13:12:54,792 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2023-02-15 13:12:54,792 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2023-02-15 13:12:54,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2023-02-15 13:12:54,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2023-02-15 13:12:54,794 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2023-02-15 13:12:54,794 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2023-02-15 13:12:54,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:12:54,817 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:12:54,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54 WrapperNode [2023-02-15 13:12:54,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:12:54,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:12:54,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:12:54,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:12:54,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,879 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2023-02-15 13:12:54,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:12:54,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:12:54,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:12:54,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:12:54,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,914 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:12:54,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:12:54,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:12:54,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:12:54,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (1/1) ... [2023-02-15 13:12:54,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:12:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:12:54,967 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) [2023-02-15 13:12:54,973 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 [2023-02-15 13:12:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:12:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:12:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:12:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:12:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:12:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:12:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:12:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:12:55,097 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:12:55,098 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:12:55,458 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:12:55,464 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:12:55,464 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-15 13:12:55,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:12:55 BoogieIcfgContainer [2023-02-15 13:12:55,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:12:55,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:12:55,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:12:55,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:12:55,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:12:54" (1/3) ... [2023-02-15 13:12:55,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a47368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:12:55, skipping insertion in model container [2023-02-15 13:12:55,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:54" (2/3) ... [2023-02-15 13:12:55,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a47368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:12:55, skipping insertion in model container [2023-02-15 13:12:55,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:12:55" (3/3) ... [2023-02-15 13:12:55,471 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2023-02-15 13:12:55,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:12:55,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2023-02-15 13:12:55,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:12:55,519 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53ff7832, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>] [2023-02-15 13:12:55,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2023-02-15 13:12:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:12:55,527 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:55,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:12:55,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:12:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:55,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805516499] [2023-02-15 13:12:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:55,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:55,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805516499] [2023-02-15 13:12:55,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805516499] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:55,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:55,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:12:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279233684] [2023-02-15 13:12:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:55,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:12:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:12:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:55,736 INFO L87 Difference]: Start difference. First operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:55,901 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2023-02-15 13:12:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:12:55,903 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 [2023-02-15 13:12:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:55,914 INFO L225 Difference]: With dead ends: 201 [2023-02-15 13:12:55,914 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 13:12:55,916 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 [2023-02-15 13:12:55,920 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:55,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 13:12:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2023-02-15 13:12:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 192 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2023-02-15 13:12:55,972 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 3 [2023-02-15 13:12:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:55,972 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2023-02-15 13:12:55,973 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) [2023-02-15 13:12:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2023-02-15 13:12:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:12:55,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:55,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:12:55,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:12:55,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:12:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:55,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316916719] [2023-02-15 13:12:55,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:55,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:56,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316916719] [2023-02-15 13:12:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316916719] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:56,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:56,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:12:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919738761] [2023-02-15 13:12:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:56,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:12:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:12:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:56,093 INFO L87 Difference]: Start difference. First operand 193 states and 204 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) [2023-02-15 13:12:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:56,201 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2023-02-15 13:12:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:12:56,207 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 [2023-02-15 13:12:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:56,210 INFO L225 Difference]: With dead ends: 222 [2023-02-15 13:12:56,210 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 13:12:56,210 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 [2023-02-15 13:12:56,211 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:56,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 13:12:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2023-02-15 13:12:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.671641791044776) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2023-02-15 13:12:56,218 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 3 [2023-02-15 13:12:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:56,218 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2023-02-15 13:12:56,218 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) [2023-02-15 13:12:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2023-02-15 13:12:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:12:56,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:56,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:12:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:12:56,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2023-02-15 13:12:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449412948] [2023-02-15 13:12:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:56,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449412948] [2023-02-15 13:12:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449412948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:56,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:56,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:12:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485733242] [2023-02-15 13:12:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:12:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:12:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:56,251 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:56,278 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2023-02-15 13:12:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:12:56,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:12:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:56,280 INFO L225 Difference]: With dead ends: 217 [2023-02-15 13:12:56,280 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 13:12:56,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:56,281 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 177 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:56,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:12:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 13:12:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2023-02-15 13:12:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2023-02-15 13:12:56,288 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 6 [2023-02-15 13:12:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:56,288 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2023-02-15 13:12:56,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2023-02-15 13:12:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:12:56,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:56,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:56,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:12:56,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:56,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2023-02-15 13:12:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:56,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052416779] [2023-02-15 13:12:56,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:56,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052416779] [2023-02-15 13:12:56,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052416779] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:56,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:56,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645529197] [2023-02-15 13:12:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:56,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:56,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:56,420 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:56,558 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2023-02-15 13:12:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:12:56,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-02-15 13:12:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:56,559 INFO L225 Difference]: With dead ends: 199 [2023-02-15 13:12:56,559 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 13:12:56,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:56,560 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 5 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:56,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 539 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 13:12:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-15 13:12:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2023-02-15 13:12:56,565 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 12 [2023-02-15 13:12:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:56,565 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2023-02-15 13:12:56,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2023-02-15 13:12:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:12:56,566 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:56,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:56,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:12:56,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2023-02-15 13:12:56,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:56,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112943643] [2023-02-15 13:12:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:56,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112943643] [2023-02-15 13:12:56,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112943643] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:56,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:56,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934997424] [2023-02-15 13:12:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:56,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:56,746 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:56,900 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2023-02-15 13:12:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:12:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-02-15 13:12:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:56,902 INFO L225 Difference]: With dead ends: 198 [2023-02-15 13:12:56,902 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 13:12:56,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:56,902 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 3 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:56,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 548 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 13:12:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-02-15 13:12:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2023-02-15 13:12:56,907 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 12 [2023-02-15 13:12:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:56,907 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2023-02-15 13:12:56,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2023-02-15 13:12:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:12:56,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:56,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:56,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:12:56,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2023-02-15 13:12:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276537779] [2023-02-15 13:12:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:56,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276537779] [2023-02-15 13:12:56,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276537779] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:56,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:56,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:12:56,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472553525] [2023-02-15 13:12:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:56,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:12:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:56,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:12:56,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:56,942 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:56,949 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2023-02-15 13:12:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:12:56,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 13:12:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:56,950 INFO L225 Difference]: With dead ends: 199 [2023-02-15 13:12:56,950 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 13:12:56,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:56,951 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:56,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:12:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 13:12:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-15 13:12:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2023-02-15 13:12:56,955 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 14 [2023-02-15 13:12:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:56,955 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2023-02-15 13:12:56,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2023-02-15 13:12:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:12:56,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:56,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:56,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:12:56,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:56,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2023-02-15 13:12:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:56,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862760730] [2023-02-15 13:12:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:57,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862760730] [2023-02-15 13:12:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862760730] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:57,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:57,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:12:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169207020] [2023-02-15 13:12:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:57,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:12:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:12:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:12:57,082 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:57,273 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2023-02-15 13:12:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:12:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 13:12:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:57,274 INFO L225 Difference]: With dead ends: 198 [2023-02-15 13:12:57,274 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 13:12:57,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:12:57,276 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 176 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:57,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 456 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 13:12:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-02-15 13:12:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2023-02-15 13:12:57,280 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 15 [2023-02-15 13:12:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:57,280 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2023-02-15 13:12:57,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2023-02-15 13:12:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:12:57,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:57,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:57,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:12:57,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2023-02-15 13:12:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:57,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632573766] [2023-02-15 13:12:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:57,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:57,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632573766] [2023-02-15 13:12:57,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632573766] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:57,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:57,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:12:57,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608319551] [2023-02-15 13:12:57,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:57,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:12:57,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:57,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:12:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:12:57,459 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:57,752 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2023-02-15 13:12:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:12:57,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 13:12:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:57,753 INFO L225 Difference]: With dead ends: 197 [2023-02-15 13:12:57,753 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 13:12:57,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:12:57,754 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 171 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:57,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 577 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:12:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 13:12:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-02-15 13:12:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2023-02-15 13:12:57,757 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 15 [2023-02-15 13:12:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:57,757 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2023-02-15 13:12:57,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2023-02-15 13:12:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:12:57,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:57,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:57,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:12:57,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2023-02-15 13:12:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:57,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381582938] [2023-02-15 13:12:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381582938] [2023-02-15 13:12:57,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381582938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:57,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:57,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:12:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083953978] [2023-02-15 13:12:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:57,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:12:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:12:57,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:57,828 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:57,991 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2023-02-15 13:12:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:12:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-15 13:12:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:57,993 INFO L225 Difference]: With dead ends: 289 [2023-02-15 13:12:57,993 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 13:12:57,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:12:57,993 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 197 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:57,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 651 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 13:12:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2023-02-15 13:12:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.628787878787879) internal successors, (215), 193 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2023-02-15 13:12:57,997 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2023-02-15 13:12:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:57,997 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2023-02-15 13:12:57,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2023-02-15 13:12:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:12:57,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:57,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:57,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:12:57,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2023-02-15 13:12:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95357992] [2023-02-15 13:12:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95357992] [2023-02-15 13:12:58,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95357992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:58,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:58,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:12:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668128919] [2023-02-15 13:12:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:58,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:58,117 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:58,219 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2023-02-15 13:12:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:12:58,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:12:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:58,220 INFO L225 Difference]: With dead ends: 290 [2023-02-15 13:12:58,220 INFO L226 Difference]: Without dead ends: 290 [2023-02-15 13:12:58,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:58,221 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:58,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-15 13:12:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2023-02-15 13:12:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.614814814814815) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2023-02-15 13:12:58,224 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 18 [2023-02-15 13:12:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:58,225 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2023-02-15 13:12:58,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2023-02-15 13:12:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:12:58,225 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:58,225 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] [2023-02-15 13:12:58,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:12:58,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:58,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2023-02-15 13:12:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:58,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596561967] [2023-02-15 13:12:58,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:58,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:58,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596561967] [2023-02-15 13:12:58,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596561967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:58,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:58,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:12:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785023365] [2023-02-15 13:12:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:58,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:12:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:58,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:12:58,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:12:58,291 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:58,425 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2023-02-15 13:12:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:12:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 13:12:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:58,426 INFO L225 Difference]: With dead ends: 191 [2023-02-15 13:12:58,426 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 13:12:58,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:58,427 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 258 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:58,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 118 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 13:12:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2023-02-15 13:12:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2023-02-15 13:12:58,430 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 20 [2023-02-15 13:12:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:58,431 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2023-02-15 13:12:58,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2023-02-15 13:12:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:12:58,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:58,432 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] [2023-02-15 13:12:58,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:12:58,433 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2023-02-15 13:12:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:58,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264696071] [2023-02-15 13:12:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:58,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:58,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264696071] [2023-02-15 13:12:58,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264696071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:58,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:58,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:12:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355936479] [2023-02-15 13:12:58,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:58,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:12:58,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:12:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:12:58,555 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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) [2023-02-15 13:12:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:58,788 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2023-02-15 13:12:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:12:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 [2023-02-15 13:12:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:58,790 INFO L225 Difference]: With dead ends: 248 [2023-02-15 13:12:58,790 INFO L226 Difference]: Without dead ends: 248 [2023-02-15 13:12:58,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:58,791 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 437 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:58,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 255 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:12:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-15 13:12:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2023-02-15 13:12:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 210 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2023-02-15 13:12:58,795 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 20 [2023-02-15 13:12:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:58,795 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2023-02-15 13:12:58,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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) [2023-02-15 13:12:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2023-02-15 13:12:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:12:58,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:58,797 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] [2023-02-15 13:12:58,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:12:58,797 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2023-02-15 13:12:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:58,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649594714] [2023-02-15 13:12:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:58,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649594714] [2023-02-15 13:12:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649594714] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:58,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:58,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484182993] [2023-02-15 13:12:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:12:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:12:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:12:58,822 INFO L87 Difference]: Start difference. First operand 211 states and 246 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) [2023-02-15 13:12:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:58,921 INFO L93 Difference]: Finished difference Result 243 states and 256 transitions. [2023-02-15 13:12:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:12:58,921 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 [2023-02-15 13:12:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:58,922 INFO L225 Difference]: With dead ends: 243 [2023-02-15 13:12:58,922 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 13:12:58,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:58,923 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 235 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:58,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 273 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 13:12:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2023-02-15 13:12:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2023-02-15 13:12:58,926 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 22 [2023-02-15 13:12:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:58,927 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2023-02-15 13:12:58,927 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) [2023-02-15 13:12:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2023-02-15 13:12:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:12:58,927 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:58,927 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] [2023-02-15 13:12:58,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:12:58,927 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2023-02-15 13:12:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:58,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326547755] [2023-02-15 13:12:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:58,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326547755] [2023-02-15 13:12:58,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326547755] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:58,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:58,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565733073] [2023-02-15 13:12:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:58,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:58,996 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,130 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2023-02-15 13:12:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:12:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-15 13:12:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,131 INFO L225 Difference]: With dead ends: 208 [2023-02-15 13:12:59,131 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 13:12:59,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:59,132 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 469 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 13:12:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2023-02-15 13:12:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2023-02-15 13:12:59,137 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 23 [2023-02-15 13:12:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,138 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2023-02-15 13:12:59,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2023-02-15 13:12:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:12:59,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:59,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:12:59,141 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2023-02-15 13:12:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772693609] [2023-02-15 13:12:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772693609] [2023-02-15 13:12:59,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772693609] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749362188] [2023-02-15 13:12:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:59,275 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,450 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2023-02-15 13:12:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:12:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-15 13:12:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,451 INFO L225 Difference]: With dead ends: 207 [2023-02-15 13:12:59,451 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 13:12:59,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:12:59,452 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 5 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 458 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:12:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 13:12:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2023-02-15 13:12:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.49375) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2023-02-15 13:12:59,455 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 23 [2023-02-15 13:12:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,455 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2023-02-15 13:12:59,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2023-02-15 13:12:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:12:59,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,456 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] [2023-02-15 13:12:59,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:12:59,456 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:59,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2023-02-15 13:12:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311822055] [2023-02-15 13:12:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311822055] [2023-02-15 13:12:59,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311822055] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:12:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331324149] [2023-02-15 13:12:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:12:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:12:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:12:59,594 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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) [2023-02-15 13:12:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,915 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2023-02-15 13:12:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:12:59,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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 [2023-02-15 13:12:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,916 INFO L225 Difference]: With dead ends: 206 [2023-02-15 13:12:59,917 INFO L226 Difference]: Without dead ends: 206 [2023-02-15 13:12:59,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:12:59,917 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 252 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 434 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:12:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-15 13:12:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2023-02-15 13:12:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4875) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2023-02-15 13:12:59,920 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 27 [2023-02-15 13:12:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,920 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2023-02-15 13:12:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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) [2023-02-15 13:12:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2023-02-15 13:12:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:12:59,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,920 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] [2023-02-15 13:12:59,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:12:59,921 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:12:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2023-02-15 13:12:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23868428] [2023-02-15 13:12:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23868428] [2023-02-15 13:13:00,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23868428] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:13:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415447538] [2023-02-15 13:13:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:13:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:13:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:13:00,155 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2023-02-15 13:13:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:00,498 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2023-02-15 13:13:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:13:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 [2023-02-15 13:13:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:00,499 INFO L225 Difference]: With dead ends: 198 [2023-02-15 13:13:00,499 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 13:13:00,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:13:00,500 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 268 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:00,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 413 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 13:13:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2023-02-15 13:13:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 187 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2023-02-15 13:13:00,502 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 27 [2023-02-15 13:13:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:00,503 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2023-02-15 13:13:00,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2023-02-15 13:13:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2023-02-15 13:13:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:13:00,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:00,503 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] [2023-02-15 13:13:00,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:13:00,503 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2023-02-15 13:13:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:00,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88117565] [2023-02-15 13:13:00,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88117565] [2023-02-15 13:13:00,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88117565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547905871] [2023-02-15 13:13:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:00,524 INFO L87 Difference]: Start difference. First operand 188 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:00,530 INFO L93 Difference]: Finished difference Result 262 states and 307 transitions. [2023-02-15 13:13:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:00,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2023-02-15 13:13:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:00,531 INFO L225 Difference]: With dead ends: 262 [2023-02-15 13:13:00,532 INFO L226 Difference]: Without dead ends: 262 [2023-02-15 13:13:00,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:00,532 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:00,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-15 13:13:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 194. [2023-02-15 13:13:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 193 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2023-02-15 13:13:00,535 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 28 [2023-02-15 13:13:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:00,536 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2023-02-15 13:13:00,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2023-02-15 13:13:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:13:00,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:00,536 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] [2023-02-15 13:13:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:13:00,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2023-02-15 13:13:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:00,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483343260] [2023-02-15 13:13:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483343260] [2023-02-15 13:13:00,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483343260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:13:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645421453] [2023-02-15 13:13:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:13:00,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:13:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:13:00,627 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:00,729 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2023-02-15 13:13:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:13:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-02-15 13:13:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:00,731 INFO L225 Difference]: With dead ends: 199 [2023-02-15 13:13:00,731 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 13:13:00,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:00,731 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 337 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:00,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 232 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 13:13:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 190. [2023-02-15 13:13:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 189 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2023-02-15 13:13:00,735 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 29 [2023-02-15 13:13:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:00,735 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2023-02-15 13:13:00,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2023-02-15 13:13:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:13:00,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:00,736 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] [2023-02-15 13:13:00,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:13:00,736 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2023-02-15 13:13:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:00,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804482944] [2023-02-15 13:13:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804482944] [2023-02-15 13:13:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804482944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878787437] [2023-02-15 13:13:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:00,762 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:00,773 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2023-02-15 13:13:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:00,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-02-15 13:13:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:00,774 INFO L225 Difference]: With dead ends: 188 [2023-02-15 13:13:00,774 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 13:13:00,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:00,775 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:00,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 13:13:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-02-15 13:13:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 187 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2023-02-15 13:13:00,778 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 29 [2023-02-15 13:13:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:00,778 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2023-02-15 13:13:00,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2023-02-15 13:13:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:13:00,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:00,779 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] [2023-02-15 13:13:00,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 13:13:00,780 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2023-02-15 13:13:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:00,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898258453] [2023-02-15 13:13:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898258453] [2023-02-15 13:13:00,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898258453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:13:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686480607] [2023-02-15 13:13:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:00,941 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:01,196 INFO L93 Difference]: Finished difference Result 291 states and 320 transitions. [2023-02-15 13:13:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:13:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 13:13:01,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:01,197 INFO L225 Difference]: With dead ends: 291 [2023-02-15 13:13:01,197 INFO L226 Difference]: Without dead ends: 291 [2023-02-15 13:13:01,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:13:01,198 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 452 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:01,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 710 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-02-15 13:13:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 200. [2023-02-15 13:13:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2023-02-15 13:13:01,201 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 30 [2023-02-15 13:13:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:01,201 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2023-02-15 13:13:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2023-02-15 13:13:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:13:01,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:01,202 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:01,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:13:01,202 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2023-02-15 13:13:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:01,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145750651] [2023-02-15 13:13:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:01,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145750651] [2023-02-15 13:13:01,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145750651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:01,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577950515] [2023-02-15 13:13:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:01,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:01,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:13:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:01,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 13:13:01,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:01,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:01,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:01,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:01,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:01,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:01,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:01,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:01,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:01,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:01,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:01,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:13:01,692 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:01,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:01,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-15 13:13:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:01,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:02,021 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 13:13:02,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 13:13:02,033 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 13:13:02,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:02,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577950515] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:02,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:02,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-15 13:13:02,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037859923] [2023-02-15 13:13:02,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:02,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:13:02,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:02,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:13:02,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:02,046 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:02,311 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2023-02-15 13:13:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:02,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 13:13:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:02,313 INFO L225 Difference]: With dead ends: 294 [2023-02-15 13:13:02,313 INFO L226 Difference]: Without dead ends: 294 [2023-02-15 13:13:02,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:13:02,314 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 409 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:02,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 809 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-02-15 13:13:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 228. [2023-02-15 13:13:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.405128205128205) internal successors, (274), 227 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2023-02-15 13:13:02,317 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 32 [2023-02-15 13:13:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:02,317 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2023-02-15 13:13:02,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2023-02-15 13:13:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:13:02,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:02,317 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] [2023-02-15 13:13:02,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:13:02,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 13:13:02,524 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2023-02-15 13:13:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:02,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665215946] [2023-02-15 13:13:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665215946] [2023-02-15 13:13:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665215946] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:02,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:13:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795752661] [2023-02-15 13:13:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:13:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:13:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:13:02,741 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:03,119 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2023-02-15 13:13:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:13:03,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 13:13:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:03,121 INFO L225 Difference]: With dead ends: 334 [2023-02-15 13:13:03,121 INFO L226 Difference]: Without dead ends: 334 [2023-02-15 13:13:03,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:13:03,121 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 501 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:03,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 769 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:13:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-02-15 13:13:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 229. [2023-02-15 13:13:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2023-02-15 13:13:03,125 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 35 [2023-02-15 13:13:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:03,125 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2023-02-15 13:13:03,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2023-02-15 13:13:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:13:03,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:03,125 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] [2023-02-15 13:13:03,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 13:13:03,126 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:03,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2023-02-15 13:13:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:03,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611103803] [2023-02-15 13:13:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611103803] [2023-02-15 13:13:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611103803] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:03,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:03,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:13:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822452614] [2023-02-15 13:13:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:03,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:13:03,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:03,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:13:03,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:03,516 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:04,136 INFO L93 Difference]: Finished difference Result 408 states and 438 transitions. [2023-02-15 13:13:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:13:04,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 13:13:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:04,138 INFO L225 Difference]: With dead ends: 408 [2023-02-15 13:13:04,138 INFO L226 Difference]: Without dead ends: 408 [2023-02-15 13:13:04,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:13:04,138 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 457 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:04,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1009 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:13:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-15 13:13:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 235. [2023-02-15 13:13:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 234 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2023-02-15 13:13:04,143 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 35 [2023-02-15 13:13:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:04,143 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2023-02-15 13:13:04,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2023-02-15 13:13:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:13:04,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:04,143 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] [2023-02-15 13:13:04,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 13:13:04,144 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2023-02-15 13:13:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:04,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444382670] [2023-02-15 13:13:04,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:04,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444382670] [2023-02-15 13:13:04,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444382670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:04,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:04,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 13:13:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069592380] [2023-02-15 13:13:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:13:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:04,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:13:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:04,631 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:05,519 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2023-02-15 13:13:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:13:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-02-15 13:13:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:05,522 INFO L225 Difference]: With dead ends: 338 [2023-02-15 13:13:05,522 INFO L226 Difference]: Without dead ends: 338 [2023-02-15 13:13:05,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 13:13:05,523 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 600 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:05,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1002 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:13:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-02-15 13:13:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 235. [2023-02-15 13:13:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 234 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2023-02-15 13:13:05,530 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 37 [2023-02-15 13:13:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:05,530 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2023-02-15 13:13:05,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2023-02-15 13:13:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:13:05,531 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:05,531 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] [2023-02-15 13:13:05,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 13:13:05,531 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2023-02-15 13:13:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:05,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332235308] [2023-02-15 13:13:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:05,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332235308] [2023-02-15 13:13:05,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332235308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:05,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:05,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:13:05,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917683515] [2023-02-15 13:13:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:05,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:13:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:13:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:13:05,621 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:05,721 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2023-02-15 13:13:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:13:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-02-15 13:13:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:05,722 INFO L225 Difference]: With dead ends: 234 [2023-02-15 13:13:05,722 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 13:13:05,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:05,723 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:05,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 418 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 13:13:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-02-15 13:13:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.357843137254902) internal successors, (277), 233 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 277 transitions. [2023-02-15 13:13:05,726 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 277 transitions. Word has length 37 [2023-02-15 13:13:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:05,726 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 277 transitions. [2023-02-15 13:13:05,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 277 transitions. [2023-02-15 13:13:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:13:05,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:05,727 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] [2023-02-15 13:13:05,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:13:05,727 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2023-02-15 13:13:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564353394] [2023-02-15 13:13:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564353394] [2023-02-15 13:13:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564353394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:05,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:13:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980337367] [2023-02-15 13:13:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:13:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:13:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:13:05,832 INFO L87 Difference]: Start difference. First operand 234 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:05,952 INFO L93 Difference]: Finished difference Result 233 states and 276 transitions. [2023-02-15 13:13:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:13:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-02-15 13:13:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:05,954 INFO L225 Difference]: With dead ends: 233 [2023-02-15 13:13:05,954 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 13:13:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:05,954 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:05,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 412 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 13:13:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2023-02-15 13:13:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 232 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2023-02-15 13:13:05,958 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 37 [2023-02-15 13:13:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:05,958 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2023-02-15 13:13:05,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2023-02-15 13:13:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:13:05,959 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:05,959 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] [2023-02-15 13:13:05,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 13:13:05,959 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2023-02-15 13:13:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:05,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943159696] [2023-02-15 13:13:05,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:06,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943159696] [2023-02-15 13:13:06,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943159696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:06,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:06,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069606082] [2023-02-15 13:13:06,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:06,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:13:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:06,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:13:06,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:06,028 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:06,188 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2023-02-15 13:13:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:13:06,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-02-15 13:13:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:06,189 INFO L225 Difference]: With dead ends: 256 [2023-02-15 13:13:06,189 INFO L226 Difference]: Without dead ends: 256 [2023-02-15 13:13:06,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:13:06,190 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 46 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:06,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 535 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-15 13:13:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2023-02-15 13:13:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 241 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 285 transitions. [2023-02-15 13:13:06,193 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 285 transitions. Word has length 37 [2023-02-15 13:13:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:06,194 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 285 transitions. [2023-02-15 13:13:06,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 285 transitions. [2023-02-15 13:13:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:13:06,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:06,194 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] [2023-02-15 13:13:06,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 13:13:06,195 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2023-02-15 13:13:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:06,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332247187] [2023-02-15 13:13:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:06,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:06,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332247187] [2023-02-15 13:13:06,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332247187] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:06,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:06,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:06,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791116830] [2023-02-15 13:13:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:06,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:06,218 INFO L87 Difference]: Start difference. First operand 242 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:06,223 INFO L93 Difference]: Finished difference Result 243 states and 286 transitions. [2023-02-15 13:13:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:13:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:06,224 INFO L225 Difference]: With dead ends: 243 [2023-02-15 13:13:06,224 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 13:13:06,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:06,225 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:06,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 13:13:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-02-15 13:13:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 242 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2023-02-15 13:13:06,229 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 39 [2023-02-15 13:13:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:06,229 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2023-02-15 13:13:06,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2023-02-15 13:13:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:13:06,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:06,230 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] [2023-02-15 13:13:06,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 13:13:06,230 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -404838824, now seen corresponding path program 1 times [2023-02-15 13:13:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:06,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825253212] [2023-02-15 13:13:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:06,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825253212] [2023-02-15 13:13:06,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825253212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:06,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:06,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:13:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079157744] [2023-02-15 13:13:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:06,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:06,257 INFO L87 Difference]: Start difference. First operand 243 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:06,283 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2023-02-15 13:13:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:13:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:06,284 INFO L225 Difference]: With dead ends: 256 [2023-02-15 13:13:06,284 INFO L226 Difference]: Without dead ends: 256 [2023-02-15 13:13:06,285 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 [2023-02-15 13:13:06,285 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:06,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-15 13:13:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2023-02-15 13:13:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 243 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2023-02-15 13:13:06,289 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 39 [2023-02-15 13:13:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:06,289 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2023-02-15 13:13:06,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2023-02-15 13:13:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:13:06,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:06,298 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] [2023-02-15 13:13:06,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-15 13:13:06,299 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2023-02-15 13:13:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:06,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734211672] [2023-02-15 13:13:06,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:06,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734211672] [2023-02-15 13:13:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734211672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 13:13:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670008272] [2023-02-15 13:13:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:06,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:13:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:13:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:06,824 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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) [2023-02-15 13:13:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:07,499 INFO L93 Difference]: Finished difference Result 409 states and 439 transitions. [2023-02-15 13:13:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:13:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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 [2023-02-15 13:13:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:07,501 INFO L225 Difference]: With dead ends: 409 [2023-02-15 13:13:07,501 INFO L226 Difference]: Without dead ends: 409 [2023-02-15 13:13:07,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2023-02-15 13:13:07,501 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 477 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:07,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1193 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:13:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-02-15 13:13:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 244. [2023-02-15 13:13:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.330232558139535) internal successors, (286), 243 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2023-02-15 13:13:07,505 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 40 [2023-02-15 13:13:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:07,505 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2023-02-15 13:13:07,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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) [2023-02-15 13:13:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2023-02-15 13:13:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:13:07,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:07,506 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] [2023-02-15 13:13:07,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 13:13:07,506 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553849, now seen corresponding path program 1 times [2023-02-15 13:13:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569771059] [2023-02-15 13:13:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:07,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569771059] [2023-02-15 13:13:07,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569771059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:07,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:07,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 13:13:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345609170] [2023-02-15 13:13:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:07,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:13:07,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:13:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:07,766 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 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) [2023-02-15 13:13:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:08,147 INFO L93 Difference]: Finished difference Result 243 states and 285 transitions. [2023-02-15 13:13:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:13:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 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 [2023-02-15 13:13:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:08,148 INFO L225 Difference]: With dead ends: 243 [2023-02-15 13:13:08,148 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 13:13:08,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:13:08,148 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 205 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:08,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 766 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:13:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 13:13:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-02-15 13:13:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 242 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2023-02-15 13:13:08,151 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 40 [2023-02-15 13:13:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:08,152 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2023-02-15 13:13:08,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 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) [2023-02-15 13:13:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2023-02-15 13:13:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:13:08,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:08,152 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] [2023-02-15 13:13:08,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-15 13:13:08,152 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553848, now seen corresponding path program 1 times [2023-02-15 13:13:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004571483] [2023-02-15 13:13:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:08,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:08,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004571483] [2023-02-15 13:13:08,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004571483] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:08,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:08,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 13:13:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780624792] [2023-02-15 13:13:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:08,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:13:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:13:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:08,496 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 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) [2023-02-15 13:13:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:08,884 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2023-02-15 13:13:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:13:08,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 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 [2023-02-15 13:13:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:08,885 INFO L225 Difference]: With dead ends: 242 [2023-02-15 13:13:08,885 INFO L226 Difference]: Without dead ends: 242 [2023-02-15 13:13:08,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:13:08,886 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 202 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:08,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 618 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:13:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-15 13:13:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-02-15 13:13:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 241 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2023-02-15 13:13:08,889 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 40 [2023-02-15 13:13:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:08,889 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2023-02-15 13:13:08,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 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) [2023-02-15 13:13:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2023-02-15 13:13:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:13:08,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:08,889 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] [2023-02-15 13:13:08,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-15 13:13:08,890 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1626494914, now seen corresponding path program 1 times [2023-02-15 13:13:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:08,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013720851] [2023-02-15 13:13:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:08,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:08,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013720851] [2023-02-15 13:13:08,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013720851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:08,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:08,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:08,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942127427] [2023-02-15 13:13:08,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:08,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:13:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:13:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:08,965 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:09,127 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2023-02-15 13:13:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:09,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2023-02-15 13:13:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:09,128 INFO L225 Difference]: With dead ends: 252 [2023-02-15 13:13:09,128 INFO L226 Difference]: Without dead ends: 252 [2023-02-15 13:13:09,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:13:09,129 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 31 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:09,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 449 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-02-15 13:13:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2023-02-15 13:13:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 238 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2023-02-15 13:13:09,134 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 41 [2023-02-15 13:13:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:09,134 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2023-02-15 13:13:09,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2023-02-15 13:13:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:13:09,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:09,134 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] [2023-02-15 13:13:09,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-15 13:13:09,135 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1357177023, now seen corresponding path program 1 times [2023-02-15 13:13:09,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:09,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364700375] [2023-02-15 13:13:09,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:09,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364700375] [2023-02-15 13:13:09,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364700375] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:09,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:09,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086194665] [2023-02-15 13:13:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:09,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:09,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:09,158 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:09,193 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2023-02-15 13:13:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 13:13:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:09,194 INFO L225 Difference]: With dead ends: 249 [2023-02-15 13:13:09,194 INFO L226 Difference]: Without dead ends: 249 [2023-02-15 13:13:09,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:09,196 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 91 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:09,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-15 13:13:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2023-02-15 13:13:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 236 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2023-02-15 13:13:09,199 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 42 [2023-02-15 13:13:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:09,199 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2023-02-15 13:13:09,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2023-02-15 13:13:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:13:09,199 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:09,199 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:09,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-15 13:13:09,200 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -284774687, now seen corresponding path program 1 times [2023-02-15 13:13:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:09,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005057262] [2023-02-15 13:13:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005057262] [2023-02-15 13:13:09,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005057262] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:09,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408145278] [2023-02-15 13:13:09,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:09,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:09,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:09,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:13:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:09,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:13:09,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:09,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:09,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:09,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:09,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:09,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:09,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:09,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:13:09,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:13:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:09,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:09,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408145278] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:09,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:09,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-15 13:13:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47366673] [2023-02-15 13:13:09,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:09,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:13:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:13:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:09,702 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:09,864 INFO L93 Difference]: Finished difference Result 290 states and 324 transitions. [2023-02-15 13:13:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 13:13:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:09,865 INFO L225 Difference]: With dead ends: 290 [2023-02-15 13:13:09,865 INFO L226 Difference]: Without dead ends: 290 [2023-02-15 13:13:09,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:13:09,866 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 78 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:09,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 547 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-15 13:13:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2023-02-15 13:13:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 258 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2023-02-15 13:13:09,869 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 42 [2023-02-15 13:13:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:09,869 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2023-02-15 13:13:09,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2023-02-15 13:13:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:13:09,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:09,869 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] [2023-02-15 13:13:09,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 13:13:10,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-15 13:13:10,074 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash -877180804, now seen corresponding path program 1 times [2023-02-15 13:13:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:10,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459944710] [2023-02-15 13:13:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:10,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459944710] [2023-02-15 13:13:10,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459944710] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:10,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:10,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:13:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753856869] [2023-02-15 13:13:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:10,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:13:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:10,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:13:10,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:13:10,220 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:10,494 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2023-02-15 13:13:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:13:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2023-02-15 13:13:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:10,495 INFO L225 Difference]: With dead ends: 306 [2023-02-15 13:13:10,495 INFO L226 Difference]: Without dead ends: 306 [2023-02-15 13:13:10,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:13:10,496 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 360 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:10,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 578 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-02-15 13:13:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2023-02-15 13:13:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 258 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2023-02-15 13:13:10,499 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 43 [2023-02-15 13:13:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:10,499 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2023-02-15 13:13:10,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2023-02-15 13:13:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:13:10,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:10,499 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] [2023-02-15 13:13:10,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-02-15 13:13:10,500 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash -877180803, now seen corresponding path program 1 times [2023-02-15 13:13:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:10,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094356138] [2023-02-15 13:13:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:10,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094356138] [2023-02-15 13:13:10,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094356138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:10,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:10,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:13:10,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76311619] [2023-02-15 13:13:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:10,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:13:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:13:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:13:10,745 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:11,063 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2023-02-15 13:13:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:13:11,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2023-02-15 13:13:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:11,065 INFO L225 Difference]: With dead ends: 306 [2023-02-15 13:13:11,065 INFO L226 Difference]: Without dead ends: 306 [2023-02-15 13:13:11,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:13:11,065 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 254 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:11,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 600 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-02-15 13:13:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2023-02-15 13:13:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 258 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 305 transitions. [2023-02-15 13:13:11,068 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 305 transitions. Word has length 43 [2023-02-15 13:13:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:11,069 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 305 transitions. [2023-02-15 13:13:11,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2023-02-15 13:13:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:13:11,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:11,069 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] [2023-02-15 13:13:11,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-02-15 13:13:11,069 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -238079422, now seen corresponding path program 1 times [2023-02-15 13:13:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:11,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689703959] [2023-02-15 13:13:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689703959] [2023-02-15 13:13:11,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689703959] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:11,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434641607] [2023-02-15 13:13:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:11,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:11,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:13:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:11,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 13:13:11,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:11,263 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 13:13:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:11,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:13:11,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434641607] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:11,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:11,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-02-15 13:13:11,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800737692] [2023-02-15 13:13:11,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:11,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:13:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:13:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:13:11,336 INFO L87 Difference]: Start difference. First operand 259 states and 305 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:11,408 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2023-02-15 13:13:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:13:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 43 [2023-02-15 13:13:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:11,409 INFO L225 Difference]: With dead ends: 290 [2023-02-15 13:13:11,409 INFO L226 Difference]: Without dead ends: 266 [2023-02-15 13:13:11,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:13:11,409 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:11,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-15 13:13:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-02-15 13:13:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2946058091286308) internal successors, (312), 265 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 312 transitions. [2023-02-15 13:13:11,412 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 312 transitions. Word has length 43 [2023-02-15 13:13:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:11,412 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 312 transitions. [2023-02-15 13:13:11,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 312 transitions. [2023-02-15 13:13:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:13:11,413 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:11,413 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] [2023-02-15 13:13:11,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 13:13:11,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:11,614 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1157151236, now seen corresponding path program 1 times [2023-02-15 13:13:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:11,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798863185] [2023-02-15 13:13:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:11,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798863185] [2023-02-15 13:13:11,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798863185] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:11,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:11,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932900628] [2023-02-15 13:13:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:11,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:11,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:11,803 INFO L87 Difference]: Start difference. First operand 266 states and 312 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:12,058 INFO L93 Difference]: Finished difference Result 291 states and 325 transitions. [2023-02-15 13:13:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:13:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2023-02-15 13:13:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:12,059 INFO L225 Difference]: With dead ends: 291 [2023-02-15 13:13:12,059 INFO L226 Difference]: Without dead ends: 291 [2023-02-15 13:13:12,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:12,060 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 164 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:12,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 464 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-02-15 13:13:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 265. [2023-02-15 13:13:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 264 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2023-02-15 13:13:12,063 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 45 [2023-02-15 13:13:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:12,063 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2023-02-15 13:13:12,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2023-02-15 13:13:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:13:12,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:12,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:12,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-02-15 13:13:12,063 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:12,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1529922318, now seen corresponding path program 1 times [2023-02-15 13:13:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:12,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848913244] [2023-02-15 13:13:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848913244] [2023-02-15 13:13:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848913244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:12,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171352959] [2023-02-15 13:13:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:12,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:12,087 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:12,093 INFO L93 Difference]: Finished difference Result 405 states and 481 transitions. [2023-02-15 13:13:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2023-02-15 13:13:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:12,095 INFO L225 Difference]: With dead ends: 405 [2023-02-15 13:13:12,095 INFO L226 Difference]: Without dead ends: 405 [2023-02-15 13:13:12,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:12,095 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:12,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-15 13:13:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 302. [2023-02-15 13:13:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 301 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 368 transitions. [2023-02-15 13:13:12,099 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 368 transitions. Word has length 45 [2023-02-15 13:13:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:12,099 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 368 transitions. [2023-02-15 13:13:12,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 368 transitions. [2023-02-15 13:13:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:13:12,099 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:12,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:12,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-02-15 13:13:12,099 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1376244065, now seen corresponding path program 1 times [2023-02-15 13:13:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:12,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311575245] [2023-02-15 13:13:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:12,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:12,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311575245] [2023-02-15 13:13:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311575245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:12,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:13:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937840711] [2023-02-15 13:13:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:12,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:13:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:13:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:13:12,157 INFO L87 Difference]: Start difference. First operand 302 states and 368 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:12,231 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2023-02-15 13:13:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:13:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-02-15 13:13:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:12,232 INFO L225 Difference]: With dead ends: 249 [2023-02-15 13:13:12,232 INFO L226 Difference]: Without dead ends: 249 [2023-02-15 13:13:12,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:12,233 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:12,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-15 13:13:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2023-02-15 13:13:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 225 states have (on average 1.2444444444444445) internal successors, (280), 248 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2023-02-15 13:13:12,236 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 47 [2023-02-15 13:13:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:12,236 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2023-02-15 13:13:12,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2023-02-15 13:13:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 13:13:12,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:12,236 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] [2023-02-15 13:13:12,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-02-15 13:13:12,236 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1538447444, now seen corresponding path program 1 times [2023-02-15 13:13:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:12,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39706716] [2023-02-15 13:13:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:13:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:12,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39706716] [2023-02-15 13:13:12,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39706716] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:12,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:13:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768468412] [2023-02-15 13:13:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:12,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:13:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:13:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:13:12,400 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:12,685 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2023-02-15 13:13:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:13:12,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-02-15 13:13:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:12,686 INFO L225 Difference]: With dead ends: 238 [2023-02-15 13:13:12,686 INFO L226 Difference]: Without dead ends: 238 [2023-02-15 13:13:12,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:13:12,687 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 476 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:12,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 573 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-15 13:13:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 226. [2023-02-15 13:13:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 225 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2023-02-15 13:13:12,689 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 50 [2023-02-15 13:13:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:12,690 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2023-02-15 13:13:12,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2023-02-15 13:13:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:13:12,690 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:12,690 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:12,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-02-15 13:13:12,690 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1188819543, now seen corresponding path program 1 times [2023-02-15 13:13:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:12,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208283789] [2023-02-15 13:13:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208283789] [2023-02-15 13:13:12,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208283789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:12,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:12,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:13:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101066546] [2023-02-15 13:13:12,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:12,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:13:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:13:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:13:12,786 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:12,883 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2023-02-15 13:13:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:13:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-15 13:13:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:12,884 INFO L225 Difference]: With dead ends: 240 [2023-02-15 13:13:12,885 INFO L226 Difference]: Without dead ends: 240 [2023-02-15 13:13:12,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:12,886 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 19 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:12,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 491 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-02-15 13:13:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2023-02-15 13:13:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 228 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2023-02-15 13:13:12,889 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 52 [2023-02-15 13:13:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:12,889 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2023-02-15 13:13:12,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2023-02-15 13:13:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 13:13:12,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:12,890 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:12,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-02-15 13:13:12,890 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash 426433170, now seen corresponding path program 1 times [2023-02-15 13:13:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:12,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910525870] [2023-02-15 13:13:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:13,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:13,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910525870] [2023-02-15 13:13:13,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910525870] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:13,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803109420] [2023-02-15 13:13:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:13,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:13,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:13,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:13:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:13,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 13:13:13,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:13,845 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:13:13,876 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:13:13,879 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:13:13,992 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:13:13,992 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-15 13:13:14,044 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:13:14,045 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 13:13:14,059 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 13:13:14,059 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:13:14,168 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:14,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2023-02-15 13:13:14,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 13:13:14,342 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:14,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2023-02-15 13:13:14,351 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:14,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2023-02-15 13:13:14,511 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:14,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2023-02-15 13:13:14,522 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:14,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2023-02-15 13:13:14,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:14,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2023-02-15 13:13:14,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:14,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2023-02-15 13:13:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:14,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:15,158 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1))))) is different from false [2023-02-15 13:13:15,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (or (= .cse1 0) (= (select |c_#valid| .cse1) 1)))))) is different from false [2023-02-15 13:13:15,218 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse2) 1) (= .cse2 0)))))) is different from false [2023-02-15 13:13:15,252 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1479) .cse0 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1)))))) (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse3 0) (= (select |c_#valid| .cse3) 1)))))) is different from false [2023-02-15 13:13:15,264 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1478))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1479) .cse4 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse5 .cse4 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) 1)))))))) is different from false [2023-02-15 13:13:15,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (or (= .cse4 0) (= (select |c_#valid| .cse4) 1)))))) is different from false [2023-02-15 13:13:15,642 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 13:13:15,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2023-02-15 13:13:15,658 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-02-15 13:13:15,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2023-02-15 13:13:15,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:15,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 187 [2023-02-15 13:13:15,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2023-02-15 13:13:15,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:15,681 INFO L350 Elim1Store]: Elim1 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 100 treesize of output 96 [2023-02-15 13:13:15,705 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:13:15,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 156 [2023-02-15 13:13:15,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 116 [2023-02-15 13:13:15,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2023-02-15 13:13:15,965 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-02-15 13:13:15,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 75 [2023-02-15 13:13:15,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:15,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 374 [2023-02-15 13:13:15,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 315 [2023-02-15 13:13:15,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:15,985 INFO L350 Elim1Store]: Elim1 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 315 treesize of output 285 [2023-02-15 13:13:25,453 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 43 DAG size of output: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:13:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:25,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803109420] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:25,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:25,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 45 [2023-02-15 13:13:25,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535570898] [2023-02-15 13:13:25,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:25,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 13:13:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 13:13:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1288, Unknown=10, NotChecked=474, Total=1980 [2023-02-15 13:13:25,471 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:27,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= .cse1 0) (= |c_ULTIMATE.start_main_#t~malloc10#1.offset| 0) (= (select .cse2 .cse3) 0) (= (select .cse4 .cse3) 0) (= (select .cse0 .cse5) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc10#1.base|) 1) (not (<= (+ |c_ULTIMATE.start_main_~list~0#1.offset| 1) |c_ULTIMATE.start_main_~end~0#1.offset|)) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse6 .cse7 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) .cse7 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5) 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5))) (or (= .cse8 0) (= (select |c_#valid| .cse8) 1)))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (= (select .cse4 .cse5) 0) (= .cse1 |c_ULTIMATE.start_main_#t~malloc10#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)))) is different from false [2023-02-15 13:13:32,160 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1))))) is different from false [2023-02-15 13:13:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:46,168 INFO L93 Difference]: Finished difference Result 689 states and 745 transitions. [2023-02-15 13:13:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-02-15 13:13:46,168 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-02-15 13:13:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:46,170 INFO L225 Difference]: With dead ends: 689 [2023-02-15 13:13:46,170 INFO L226 Difference]: Without dead ends: 689 [2023-02-15 13:13:46,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=1148, Invalid=7184, Unknown=72, NotChecked=1496, Total=9900 [2023-02-15 13:13:46,172 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 2046 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 123 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 5234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 1990 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:46,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 3389 Invalid, 5234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3094 Invalid, 27 Unknown, 1990 Unchecked, 4.5s Time] [2023-02-15 13:13:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-02-15 13:13:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 305. [2023-02-15 13:13:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 281 states have (on average 1.2135231316725978) internal successors, (341), 304 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 341 transitions. [2023-02-15 13:13:46,176 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 341 transitions. Word has length 54 [2023-02-15 13:13:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:46,177 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 341 transitions. [2023-02-15 13:13:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 341 transitions. [2023-02-15 13:13:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 13:13:46,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:46,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:46,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:46,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:46,383 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851803, now seen corresponding path program 1 times [2023-02-15 13:13:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:46,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628479068] [2023-02-15 13:13:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:46,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:46,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628479068] [2023-02-15 13:13:46,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628479068] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:46,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998890771] [2023-02-15 13:13:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:46,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:46,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:46,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:13:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:47,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 13:13:47,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:47,120 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:13:47,267 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:13:47,268 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-15 13:13:47,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:47,459 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:47,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 13:13:47,592 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:47,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:13:47,673 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:47,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 13:13:47,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:47,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 13:13:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:47,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:48,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:48,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-02-15 13:13:48,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:48,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2023-02-15 13:13:48,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:48,621 INFO L350 Elim1Store]: Elim1 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 116 treesize of output 114 [2023-02-15 13:13:48,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2023-02-15 13:13:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:54,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998890771] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:54,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:54,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2023-02-15 13:13:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022708057] [2023-02-15 13:13:54,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:54,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:13:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:13:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=993, Unknown=21, NotChecked=0, Total=1190 [2023-02-15 13:13:54,162 INFO L87 Difference]: Start difference. First operand 305 states and 341 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:57,290 INFO L93 Difference]: Finished difference Result 671 states and 715 transitions. [2023-02-15 13:13:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 13:13:57,299 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 56 [2023-02-15 13:13:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:57,301 INFO L225 Difference]: With dead ends: 671 [2023-02-15 13:13:57,301 INFO L226 Difference]: Without dead ends: 671 [2023-02-15 13:13:57,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=670, Invalid=2614, Unknown=22, NotChecked=0, Total=3306 [2023-02-15 13:13:57,302 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 2022 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:57,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 1924 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 13:13:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-02-15 13:13:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 430. [2023-02-15 13:13:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 406 states have (on average 1.1945812807881773) internal successors, (485), 429 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 485 transitions. [2023-02-15 13:13:57,319 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 485 transitions. Word has length 56 [2023-02-15 13:13:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:57,320 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 485 transitions. [2023-02-15 13:13:57,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 485 transitions. [2023-02-15 13:13:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 13:13:57,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:57,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:57,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:57,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-02-15 13:13:57,537 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:13:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851802, now seen corresponding path program 1 times [2023-02-15 13:13:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:57,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031168139] [2023-02-15 13:13:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:58,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031168139] [2023-02-15 13:13:58,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031168139] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:58,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615553771] [2023-02-15 13:13:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:58,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:58,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:58,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:13:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:58,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 13:13:58,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:58,436 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:13:58,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 13:13:58,469 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:13:58,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 13:13:58,673 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 13:13:58,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 78 [2023-02-15 13:13:58,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:58,687 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 13:13:58,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2023-02-15 13:13:59,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:59,281 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2023-02-15 13:13:59,281 INFO L350 Elim1Store]: Elim1 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 5 case distinctions, treesize of input 85 treesize of output 76 [2023-02-15 13:13:59,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:59,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:59,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 59 [2023-02-15 13:13:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:59,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:00,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:00,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 206 [2023-02-15 13:14:33,018 WARN L233 SmtUtils]: Spent 18.76s on a formula simplification. DAG size of input: 116 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:14:41,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:41,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 555 treesize of output 446 [2023-02-15 13:14:41,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:41,763 INFO L350 Elim1Store]: Elim1 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 1055 treesize of output 812 [2023-02-15 13:15:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:03,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615553771] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:03,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:03,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2023-02-15 13:15:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456900895] [2023-02-15 13:15:03,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:03,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:15:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:15:03,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=947, Unknown=1, NotChecked=0, Total=1056 [2023-02-15 13:15:03,330 INFO L87 Difference]: Start difference. First operand 430 states and 485 transitions. Second operand has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:28,048 INFO L93 Difference]: Finished difference Result 687 states and 728 transitions. [2023-02-15 13:15:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-02-15 13:15:28,048 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 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 56 [2023-02-15 13:15:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:28,050 INFO L225 Difference]: With dead ends: 687 [2023-02-15 13:15:28,050 INFO L226 Difference]: Without dead ends: 687 [2023-02-15 13:15:28,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=1452, Invalid=8053, Unknown=1, NotChecked=0, Total=9506 [2023-02-15 13:15:28,052 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 2779 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 166 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:28,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 1976 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2411 Invalid, 5 Unknown, 0 Unchecked, 7.9s Time] [2023-02-15 13:15:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-02-15 13:15:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 460. [2023-02-15 13:15:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 436 states have (on average 1.1972477064220184) internal successors, (522), 459 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 522 transitions. [2023-02-15 13:15:28,075 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 522 transitions. Word has length 56 [2023-02-15 13:15:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:28,075 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 522 transitions. [2023-02-15 13:15:28,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 522 transitions. [2023-02-15 13:15:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 13:15:28,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:28,076 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] [2023-02-15 13:15:28,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:28,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:28,278 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:15:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1627380482, now seen corresponding path program 1 times [2023-02-15 13:15:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:28,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125157401] [2023-02-15 13:15:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:28,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:29,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125157401] [2023-02-15 13:15:29,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125157401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:29,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967743529] [2023-02-15 13:15:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:29,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:15:29,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:15:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:29,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:15:29,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:30,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:30,450 INFO L321 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2023-02-15 13:15:30,451 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 65 [2023-02-15 13:15:30,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:30,483 INFO L321 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2023-02-15 13:15:30,483 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 35 [2023-02-15 13:15:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:30,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:31,284 INFO L321 Elim1Store]: treesize reduction 8, result has 92.2 percent of original size [2023-02-15 13:15:31,284 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 142 [2023-02-15 13:15:31,396 INFO L321 Elim1Store]: treesize reduction 22, result has 70.7 percent of original size [2023-02-15 13:15:31,396 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 127 [2023-02-15 13:15:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:32,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967743529] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:32,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:32,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2023-02-15 13:15:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114709067] [2023-02-15 13:15:32,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 13:15:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 13:15:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2023-02-15 13:15:32,114 INFO L87 Difference]: Start difference. First operand 460 states and 522 transitions. Second operand has 31 states, 31 states have (on average 5.161290322580645) internal successors, (160), 31 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:37,134 INFO L93 Difference]: Finished difference Result 622 states and 687 transitions. [2023-02-15 13:15:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 13:15:37,134 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.161290322580645) internal successors, (160), 31 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-02-15 13:15:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:37,136 INFO L225 Difference]: With dead ends: 622 [2023-02-15 13:15:37,136 INFO L226 Difference]: Without dead ends: 622 [2023-02-15 13:15:37,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=704, Invalid=3456, Unknown=0, NotChecked=0, Total=4160 [2023-02-15 13:15:37,137 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1125 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:37,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1402 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-15 13:15:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2023-02-15 13:15:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 522. [2023-02-15 13:15:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 498 states have (on average 1.2188755020080322) internal successors, (607), 521 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 607 transitions. [2023-02-15 13:15:37,142 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 607 transitions. Word has length 57 [2023-02-15 13:15:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:37,143 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 607 transitions. [2023-02-15 13:15:37,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.161290322580645) internal successors, (160), 31 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 607 transitions. [2023-02-15 13:15:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:15:37,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:37,143 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:15:37,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:37,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:37,350 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:15:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1135767587, now seen corresponding path program 1 times [2023-02-15 13:15:37,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:37,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090816984] [2023-02-15 13:15:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090816984] [2023-02-15 13:15:38,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090816984] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201960798] [2023-02-15 13:15:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:38,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:38,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:38,305 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:15:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:15:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:38,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 13:15:38,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:38,465 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,519 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:15:38,519 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-15 13:15:38,582 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:38,693 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,846 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:38,846 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:39,153 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 13:15:39,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2023-02-15 13:15:39,324 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:15:39,324 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 43 treesize of output 36 [2023-02-15 13:15:39,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:39,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 79 [2023-02-15 13:15:40,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:40,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2023-02-15 13:15:40,838 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:40,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2023-02-15 13:15:41,545 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 17 [2023-02-15 13:15:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:41,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:41,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:15:42,278 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:15:42,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1882 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1880 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)))) is different from false [2023-02-15 13:15:42,684 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1882 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1880 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))) is different from false [2023-02-15 13:15:42,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1880 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1876))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)))) is different from false [2023-02-15 13:15:53,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:53,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 114 [2023-02-15 13:15:53,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:53,256 INFO L350 Elim1Store]: Elim1 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 472 treesize of output 458 [2023-02-15 13:15:53,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 474 [2023-02-15 13:15:53,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 442 [2023-02-15 13:15:53,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 442 [2023-02-15 13:15:53,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 398 [2023-02-15 13:16:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 13:16:02,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201960798] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:16:02,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:16:02,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 45 [2023-02-15 13:16:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303019378] [2023-02-15 13:16:02,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:16:02,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:16:02,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:16:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1340, Unknown=88, NotChecked=410, Total=2070 [2023-02-15 13:16:02,867 INFO L87 Difference]: Start difference. First operand 522 states and 607 transitions. Second operand has 46 states, 45 states have (on average 3.311111111111111) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:35,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:16:37,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:16:42,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:16:44,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:16:48,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:16:54,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:17:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:03,471 INFO L93 Difference]: Finished difference Result 870 states and 993 transitions. [2023-02-15 13:17:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 13:17:03,472 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.311111111111111) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 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 [2023-02-15 13:17:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:03,474 INFO L225 Difference]: With dead ends: 870 [2023-02-15 13:17:03,474 INFO L226 Difference]: Without dead ends: 870 [2023-02-15 13:17:03,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=787, Invalid=4367, Unknown=122, NotChecked=730, Total=6006 [2023-02-15 13:17:03,475 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 1296 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 61 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 1564 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:03,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 2528 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2559 Invalid, 51 Unknown, 1564 Unchecked, 34.5s Time] [2023-02-15 13:17:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2023-02-15 13:17:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 504. [2023-02-15 13:17:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 480 states have (on average 1.2229166666666667) internal successors, (587), 503 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 587 transitions. [2023-02-15 13:17:03,487 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 587 transitions. Word has length 59 [2023-02-15 13:17:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:03,487 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 587 transitions. [2023-02-15 13:17:03,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.311111111111111) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 587 transitions. [2023-02-15 13:17:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:17:03,488 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:03,488 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:03,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:17:03,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-02-15 13:17:03,694 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-02-15 13:17:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1135767588, now seen corresponding path program 1 times [2023-02-15 13:17:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:03,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285278900] [2023-02-15 13:17:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285278900] [2023-02-15 13:17:09,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285278900] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715544650] [2023-02-15 13:17:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:09,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:09,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:09,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:17:09,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:17:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:09,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 13:17:09,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:09,837 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:09,868 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:10,527 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:10,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:17:10,760 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:17:10,760 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-15 13:17:11,212 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:11,264 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:12,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:12,456 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 54 [2023-02-15 13:17:12,509 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:13,352 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:13,352 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 54 [2023-02-15 13:17:13,406 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:15,010 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 13:17:15,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 13:17:15,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2023-02-15 13:17:15,742 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 13:17:15,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:17:15,926 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:17:15,926 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 43 treesize of output 36 [2023-02-15 13:17:17,936 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:17,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 87 [2023-02-15 13:17:17,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 13:17:20,876 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:20,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2023-02-15 13:17:20,971 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:20,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2023-02-15 13:17:23,014 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:23,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2023-02-15 13:17:23,105 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:23,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134